TSTP Solution File: LCL384-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : LCL384-1 : TPTP v8.2.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n029.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 : Mon May 20 23:46:12 EDT 2024

% Result   : Unsatisfiable 14.58s 2.24s
% Output   : CNFRefutation 14.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   46 (  21 unt;   0 nHn;  14 RR)
%            Number of literals    :   81 (   0 equ;  39 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :  111 (  25 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(cn_1,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).

cnf(cn_2,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).

cnf(cn_3,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).

cnf(prove_cn_45,negated_conjecture,
    ~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_45) ).

cnf(c_0_5,plain,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    inference(fof_simplification,[status(thm)],[condensed_detachment]) ).

cnf(c_0_6,plain,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    c_0_5 ).

cnf(c_0_7,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    cn_1 ).

cnf(c_0_8,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(implies(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X3,X2))
    | ~ is_a_theorem(implies(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_10,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    cn_2 ).

cnf(c_0_11,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X1,implies(X4,X3)))
    | ~ is_a_theorem(implies(X2,X4)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_12,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    cn_3 ).

cnf(c_0_13,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X2,not(X1))) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(not(X2),not(X1))) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,plain,
    ( is_a_theorem(implies(not(X1),X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_12]) ).

cnf(c_0_17,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_12]) ).

cnf(c_0_18,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( is_a_theorem(implies(not(X1),X2))
    | ~ is_a_theorem(implies(X3,X1))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_6,c_0_17]) ).

cnf(c_0_20,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(implies(X1,X4))
    | ~ is_a_theorem(implies(X4,X2)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_17]) ).

cnf(c_0_21,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X2,X4))
    | ~ is_a_theorem(implies(X4,X3)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_18]) ).

cnf(c_0_22,plain,
    ( is_a_theorem(implies(not(implies(X1,X2)),X3))
    | ~ is_a_theorem(implies(X4,X2))
    | ~ is_a_theorem(implies(X1,X4)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_8]) ).

cnf(c_0_23,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(implies(implies(not(X1),X4),X2)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_12]) ).

cnf(c_0_24,plain,
    is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
    inference(spm,[status(thm)],[c_0_13,c_0_10]) ).

cnf(c_0_25,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X4,X3))
    | ~ is_a_theorem(X4) ),
    inference(spm,[status(thm)],[c_0_21,c_0_18]) ).

cnf(c_0_26,plain,
    ( is_a_theorem(implies(not(implies(X1,X2)),X3))
    | ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_10]) ).

cnf(c_0_27,plain,
    is_a_theorem(implies(implies(not(X1),X1),implies(not(X1),X2))),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(not(X1),X1)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_10]) ).

cnf(c_0_29,plain,
    ( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
    | ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_7]) ).

cnf(c_0_30,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(not(X3),X3)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_10]) ).

cnf(c_0_31,plain,
    is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_32,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),implies(X3,X1))) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,plain,
    is_a_theorem(implies(X1,implies(X2,implies(implies(not(X3),X3),X3)))),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_34,plain,
    is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),implies(X3,X2))),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_35,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(not(X3),X4)))
    | ~ is_a_theorem(implies(implies(implies(X2,X5),implies(X1,X5)),X3)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_7]) ).

cnf(c_0_36,plain,
    is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),X2)),
    inference(spm,[status(thm)],[c_0_13,c_0_34]) ).

cnf(c_0_37,plain,
    is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(not(implies(X1,X2)),X3))),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_38,negated_conjecture,
    ~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
    inference(fof_simplification,[status(thm)],[prove_cn_45]) ).

cnf(c_0_39,plain,
    is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
    inference(spm,[status(thm)],[c_0_13,c_0_37]) ).

cnf(c_0_40,negated_conjecture,
    ~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
    c_0_38 ).

cnf(c_0_41,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))
    | ~ is_a_theorem(implies(X3,implies(X2,X4))) ),
    inference(spm,[status(thm)],[c_0_11,c_0_7]) ).

cnf(c_0_42,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
    inference(spm,[status(thm)],[c_0_35,c_0_39]) ).

cnf(c_0_43,negated_conjecture,
    ~ is_a_theorem(implies(implies(not(z),y),implies(implies(y,z),z))),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_44,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
    inference(spm,[status(thm)],[c_0_13,c_0_42]) ).

cnf(c_0_45,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : LCL384-1 : TPTP v8.2.0. Released v2.3.0.
% 0.00/0.10  % Command    : run_E %s %d THM
% 0.09/0.30  % Computer : n029.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 300
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Mon May 20 01:47:07 EDT 2024
% 0.09/0.30  % CPUTime    : 
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  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
% 14.58/2.24  # Version: 3.1.0
% 14.58/2.24  # Preprocessing class: FSSSSMSSSSSNFFN.
% 14.58/2.24  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.58/2.24  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 14.58/2.24  # Starting new_bool_3 with 300s (1) cores
% 14.58/2.24  # Starting new_bool_1 with 300s (1) cores
% 14.58/2.24  # Starting sh5l with 300s (1) cores
% 14.58/2.24  # new_bool_1 with pid 6695 completed with status 0
% 14.58/2.24  # Result found by new_bool_1
% 14.58/2.24  # Preprocessing class: FSSSSMSSSSSNFFN.
% 14.58/2.24  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.58/2.24  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 14.58/2.24  # Starting new_bool_3 with 300s (1) cores
% 14.58/2.24  # Starting new_bool_1 with 300s (1) cores
% 14.58/2.24  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 14.58/2.24  # Search class: FHUNS-FFSF21-MFFFFFNN
% 14.58/2.24  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 14.58/2.24  # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 14.58/2.24  # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 6700 completed with status 0
% 14.58/2.24  # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 14.58/2.24  # Preprocessing class: FSSSSMSSSSSNFFN.
% 14.58/2.24  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.58/2.24  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 14.58/2.24  # Starting new_bool_3 with 300s (1) cores
% 14.58/2.24  # Starting new_bool_1 with 300s (1) cores
% 14.58/2.24  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 14.58/2.24  # Search class: FHUNS-FFSF21-MFFFFFNN
% 14.58/2.24  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 14.58/2.24  # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 14.58/2.24  # Preprocessing time       : 0.001 s
% 14.58/2.24  # Presaturation interreduction done
% 14.58/2.24  
% 14.58/2.24  # Proof found!
% 14.58/2.24  # SZS status Unsatisfiable
% 14.58/2.24  # SZS output start CNFRefutation
% See solution above
% 14.58/2.24  # Parsed axioms                        : 5
% 14.58/2.24  # Removed by relevancy pruning/SinE    : 0
% 14.58/2.24  # Initial clauses                      : 5
% 14.58/2.24  # Removed in clause preprocessing      : 0
% 14.58/2.24  # Initial clauses in saturation        : 5
% 14.58/2.24  # Processed clauses                    : 22821
% 14.58/2.24  # ...of these trivial                  : 407
% 14.58/2.24  # ...subsumed                          : 20443
% 14.58/2.24  # ...remaining for further processing  : 1971
% 14.58/2.24  # Other redundant clauses eliminated   : 0
% 14.58/2.24  # Clauses deleted for lack of memory   : 0
% 14.58/2.24  # Backward-subsumed                    : 143
% 14.58/2.24  # Backward-rewritten                   : 5
% 14.58/2.24  # Generated clauses                    : 109426
% 14.58/2.24  # ...of the previous two non-redundant : 102955
% 14.58/2.24  # ...aggressively subsumed             : 0
% 14.58/2.24  # Contextual simplify-reflections      : 44
% 14.58/2.24  # Paramodulations                      : 109426
% 14.58/2.24  # Factorizations                       : 0
% 14.58/2.24  # NegExts                              : 0
% 14.58/2.24  # Equation resolutions                 : 0
% 14.58/2.24  # Disequality decompositions           : 0
% 14.58/2.24  # Total rewrite steps                  : 7211
% 14.58/2.24  # ...of those cached                   : 6348
% 14.58/2.24  # Propositional unsat checks           : 0
% 14.58/2.24  #    Propositional check models        : 0
% 14.58/2.24  #    Propositional check unsatisfiable : 0
% 14.58/2.24  #    Propositional clauses             : 0
% 14.58/2.24  #    Propositional clauses after purity: 0
% 14.58/2.24  #    Propositional unsat core size     : 0
% 14.58/2.24  #    Propositional preprocessing time  : 0.000
% 14.58/2.24  #    Propositional encoding time       : 0.000
% 14.58/2.24  #    Propositional solver time         : 0.000
% 14.58/2.24  #    Success case prop preproc time    : 0.000
% 14.58/2.24  #    Success case prop encoding time   : 0.000
% 14.58/2.24  #    Success case prop solver time     : 0.000
% 14.58/2.24  # Current number of processed clauses  : 1818
% 14.58/2.24  #    Positive orientable unit clauses  : 213
% 14.58/2.24  #    Positive unorientable unit clauses: 0
% 14.58/2.24  #    Negative unit clauses             : 60
% 14.58/2.24  #    Non-unit-clauses                  : 1545
% 14.58/2.24  # Current number of unprocessed clauses: 80010
% 14.58/2.24  # ...number of literals in the above   : 260990
% 14.58/2.24  # Current number of archived formulas  : 0
% 14.58/2.24  # Current number of archived clauses   : 153
% 14.58/2.24  # Clause-clause subsumption calls (NU) : 820166
% 14.58/2.24  # Rec. Clause-clause subsumption calls : 546348
% 14.58/2.24  # Non-unit clause-clause subsumptions  : 15915
% 14.58/2.24  # Unit Clause-clause subsumption calls : 4297
% 14.58/2.24  # Rewrite failures with RHS unbound    : 0
% 14.58/2.24  # BW rewrite match attempts            : 26887
% 14.58/2.24  # BW rewrite match successes           : 5
% 14.58/2.24  # Condensation attempts                : 0
% 14.58/2.24  # Condensation successes               : 0
% 14.58/2.24  # Termbank termtop insertions          : 1641984
% 14.58/2.24  # Search garbage collected termcells   : 8
% 14.58/2.24  
% 14.58/2.24  # -------------------------------------------------
% 14.58/2.24  # User time                : 1.753 s
% 14.58/2.24  # System time              : 0.055 s
% 14.58/2.24  # Total time               : 1.808 s
% 14.58/2.24  # Maximum resident set size: 1632 pages
% 14.58/2.24  
% 14.58/2.24  # -------------------------------------------------
% 14.58/2.24  # User time                : 1.753 s
% 14.58/2.24  # System time              : 0.058 s
% 14.58/2.24  # Total time               : 1.810 s
% 14.58/2.24  # Maximum resident set size: 1692 pages
% 14.58/2.24  % E---3.1 exiting
% 14.58/2.24  % E exiting
%------------------------------------------------------------------------------