TSTP Solution File: LCL666+1.001 by E---3.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.0
% Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 18 03:26:23 EDT 2022

% Result   : Theorem 0.15s 0.42s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   14 (   6 unt;   4 typ;   0 def)
%            Number of atoms       :   24 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   33 (  19   ~;   8   |;   6   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   3   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    9 (   0 sgn   5   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    r1: ( $i * $i ) > $o ).

tff(decl_23,type,
    p201: $i > $o ).

tff(decl_24,type,
    p101: $i > $o ).

tff(decl_25,type,
    esk1_0: $i ).

fof(main,conjecture,
    ~ ? [X1] :
        ~ ( ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( p201(X2)
                    & p101(X2) ) )
          | ~ ( p201(X1)
              & p101(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

fof(reflexivity,axiom,
    ! [X1] : r1(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).

fof(c_0_2,negated_conjecture,
    ~ ~ ? [X1] :
          ~ ( ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( p201(X2)
                      & p101(X2) ) )
            | ~ ( p201(X1)
                & p101(X1) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).

fof(c_0_3,negated_conjecture,
    ! [X4] :
      ( ( ~ r1(esk1_0,X4)
        | ~ p201(X4)
        | ~ p101(X4) )
      & p201(esk1_0)
      & p101(esk1_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

fof(c_0_4,plain,
    ! [X5] : r1(X5,X5),
    inference(variable_rename,[status(thm)],[reflexivity]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p201(X1)
    | ~ p101(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    r1(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    p101(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
    p201(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem    : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.09/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n013.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Thu Sep  1 23:34:16 EDT 2022
% 0.10/0.31  % CPUTime    : 
% 0.15/0.41  Running first-order on 8 cores theorem proving
% 0.15/0.41  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41  # Version: 3.0pre003
% 0.15/0.42  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42  # Starting sh5l with 300s (1) cores
% 0.15/0.42  # new_bool_3 with pid 27041 completed with status 0
% 0.15/0.42  # Result found by new_bool_3
% 0.15/0.42  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42  # ...ProofStateSinE()=2/2
% 0.15/0.42  # Search class: FUHNF-FFSF00-SFFFFFNN
% 0.15/0.42  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42  # SAT001_MinMin_p005000_rr_RG with pid 27049 completed with status 0
% 0.15/0.42  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.42  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42  # ...ProofStateSinE()=2/2
% 0.15/0.42  # Search class: FUHNF-FFSF00-SFFFFFNN
% 0.15/0.42  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42  # Preprocessing time       : 0.001 s
% 0.15/0.42  # Presaturation interreduction done
% 0.15/0.42  
% 0.15/0.42  # Proof found!
% 0.15/0.42  # SZS status Theorem
% 0.15/0.42  # SZS output start CNFRefutation
% See solution above
% 0.15/0.42  # Parsed axioms                        : 2
% 0.15/0.42  # Removed by relevancy pruning/SinE    : 0
% 0.15/0.42  # Initial clauses                      : 4
% 0.15/0.42  # Removed in clause preprocessing      : 0
% 0.15/0.42  # Initial clauses in saturation        : 4
% 0.15/0.42  # Processed clauses                    : 8
% 0.15/0.42  # ...of these trivial                  : 0
% 0.15/0.42  # ...subsumed                          : 0
% 0.15/0.42  # ...remaining for further processing  : 8
% 0.15/0.42  # Other redundant clauses eliminated   : 0
% 0.15/0.42  # Clauses deleted for lack of memory   : 0
% 0.15/0.42  # Backward-subsumed                    : 0
% 0.15/0.42  # Backward-rewritten                   : 0
% 0.15/0.42  # Generated clauses                    : 1
% 0.15/0.42  # ...of the previous two non-redundant : 0
% 0.15/0.42  # ...aggressively subsumed             : 0
% 0.15/0.42  # Contextual simplify-reflections      : 0
% 0.15/0.42  # Paramodulations                      : 1
% 0.15/0.42  # Factorizations                       : 0
% 0.15/0.42  # NegExts                              : 0
% 0.15/0.42  # Equation resolutions                 : 0
% 0.15/0.42  # Propositional unsat checks           : 0
% 0.15/0.42  #    Propositional check models        : 0
% 0.15/0.42  #    Propositional check unsatisfiable : 0
% 0.15/0.42  #    Propositional clauses             : 0
% 0.15/0.42  #    Propositional clauses after purity: 0
% 0.15/0.42  #    Propositional unsat core size     : 0
% 0.15/0.42  #    Propositional preprocessing time  : 0.000
% 0.15/0.42  #    Propositional encoding time       : 0.000
% 0.15/0.42  #    Propositional solver time         : 0.000
% 0.15/0.42  #    Success case prop preproc time    : 0.000
% 0.15/0.42  #    Success case prop encoding time   : 0.000
% 0.15/0.42  #    Success case prop solver time     : 0.000
% 0.15/0.42  # Current number of processed clauses  : 4
% 0.15/0.42  #    Positive orientable unit clauses  : 3
% 0.15/0.42  #    Positive unorientable unit clauses: 0
% 0.15/0.42  #    Negative unit clauses             : 0
% 0.15/0.42  #    Non-unit-clauses                  : 1
% 0.15/0.42  # Current number of unprocessed clauses: 0
% 0.15/0.42  # ...number of literals in the above   : 0
% 0.15/0.42  # Current number of archived formulas  : 0
% 0.15/0.42  # Current number of archived clauses   : 4
% 0.15/0.42  # Clause-clause subsumption calls (NU) : 0
% 0.15/0.42  # Rec. Clause-clause subsumption calls : 0
% 0.15/0.42  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.42  # Unit Clause-clause subsumption calls : 0
% 0.15/0.42  # Rewrite failures with RHS unbound    : 0
% 0.15/0.42  # BW rewrite match attempts            : 1
% 0.15/0.42  # BW rewrite match successes           : 0
% 0.15/0.42  # Condensation attempts                : 0
% 0.15/0.42  # Condensation successes               : 0
% 0.15/0.42  # Termbank termtop insertions          : 202
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.002 s
% 0.15/0.42  # System time              : 0.001 s
% 0.15/0.42  # Total time               : 0.003 s
% 0.15/0.42  # Maximum resident set size: 1596 pages
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.002 s
% 0.15/0.42  # System time              : 0.003 s
% 0.15/0.42  # Total time               : 0.005 s
% 0.15/0.42  # Maximum resident set size: 1696 pages
%------------------------------------------------------------------------------