TSTP Solution File: LCL368-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL368-1 : TPTP v8.2.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:09 EDT 2024
% Result : Unsatisfiable 21.70s 3.22s
% Output : CNFRefutation 21.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 5
% Syntax : Number of clauses : 55 ( 25 unt; 0 nHn; 20 RR)
% Number of literals : 95 ( 0 equ; 46 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 126 ( 26 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_23,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,z)),u),implies(implies(y,implies(x,z)),u))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_23) ).
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,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,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_17]) ).
cnf(c_0_19,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_20,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_21,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_18,c_0_17]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_23,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_19,c_0_20]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_26]) ).
cnf(c_0_28,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_29,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_8]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(not(X2),X4),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_31,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_32,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_28]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_10]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
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_32,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_33,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,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
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(implies(x,implies(y,z)),u),implies(implies(y,implies(x,z)),u))),
inference(fof_simplification,[status(thm)],[prove_cn_23]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_23,c_0_38]) ).
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(implies(x,implies(y,z)),u),implies(implies(y,implies(x,z)),u))),
c_0_40 ).
cnf(c_0_44,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(not(X1),X3),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_41]) ).
cnf(c_0_45,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_46,negated_conjecture,
~ is_a_theorem(implies(implies(y,implies(x,z)),implies(x,implies(y,z)))),
inference(spm,[status(thm)],[c_0_43,c_0_8]) ).
cnf(c_0_47,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_48,plain,
is_a_theorem(implies(X1,implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
~ is_a_theorem(implies(x,implies(implies(x,z),z))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))
| ~ is_a_theorem(implies(X1,implies(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_9,c_0_45]) ).
cnf(c_0_51,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(implies(X2,implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_11,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
~ is_a_theorem(implies(x,implies(not(z),x))),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_51,c_0_12]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL368-1 : TPTP v8.2.0. Released v2.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 02:33:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 21.70/3.22 # Version: 3.1.0
% 21.70/3.22 # Preprocessing class: FSSSSMSSSSSNFFN.
% 21.70/3.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.70/3.22 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 21.70/3.22 # Starting new_bool_3 with 300s (1) cores
% 21.70/3.22 # Starting new_bool_1 with 300s (1) cores
% 21.70/3.22 # Starting sh5l with 300s (1) cores
% 21.70/3.22 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 27668 completed with status 0
% 21.70/3.22 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 21.70/3.22 # Preprocessing class: FSSSSMSSSSSNFFN.
% 21.70/3.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.70/3.22 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 21.70/3.22 # No SInE strategy applied
% 21.70/3.22 # Search class: FHUNS-FFSF21-MFFFFFNN
% 21.70/3.22 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 21.70/3.22 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 21.70/3.22 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 21.70/3.22 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 21.70/3.22 # Starting new_bool_3 with 136s (1) cores
% 21.70/3.22 # Starting new_bool_1 with 136s (1) cores
% 21.70/3.22 # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 27672 completed with status 0
% 21.70/3.22 # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 21.70/3.22 # Preprocessing class: FSSSSMSSSSSNFFN.
% 21.70/3.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.70/3.22 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 21.70/3.22 # No SInE strategy applied
% 21.70/3.22 # Search class: FHUNS-FFSF21-MFFFFFNN
% 21.70/3.22 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 21.70/3.22 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 21.70/3.22 # Preprocessing time : 0.001 s
% 21.70/3.22 # Presaturation interreduction done
% 21.70/3.22
% 21.70/3.22 # Proof found!
% 21.70/3.22 # SZS status Unsatisfiable
% 21.70/3.22 # SZS output start CNFRefutation
% See solution above
% 21.70/3.22 # Parsed axioms : 5
% 21.70/3.22 # Removed by relevancy pruning/SinE : 0
% 21.70/3.22 # Initial clauses : 5
% 21.70/3.22 # Removed in clause preprocessing : 0
% 21.70/3.22 # Initial clauses in saturation : 5
% 21.70/3.22 # Processed clauses : 47817
% 21.70/3.22 # ...of these trivial : 542
% 21.70/3.22 # ...subsumed : 43791
% 21.70/3.22 # ...remaining for further processing : 3484
% 21.70/3.22 # Other redundant clauses eliminated : 0
% 21.70/3.22 # Clauses deleted for lack of memory : 0
% 21.70/3.22 # Backward-subsumed : 361
% 21.70/3.22 # Backward-rewritten : 72
% 21.70/3.22 # Generated clauses : 219945
% 21.70/3.22 # ...of the previous two non-redundant : 209818
% 21.70/3.22 # ...aggressively subsumed : 0
% 21.70/3.22 # Contextual simplify-reflections : 16
% 21.70/3.22 # Paramodulations : 219945
% 21.70/3.22 # Factorizations : 0
% 21.70/3.22 # NegExts : 0
% 21.70/3.22 # Equation resolutions : 0
% 21.70/3.22 # Disequality decompositions : 0
% 21.70/3.22 # Total rewrite steps : 10969
% 21.70/3.22 # ...of those cached : 9727
% 21.70/3.22 # Propositional unsat checks : 0
% 21.70/3.22 # Propositional check models : 0
% 21.70/3.22 # Propositional check unsatisfiable : 0
% 21.70/3.22 # Propositional clauses : 0
% 21.70/3.22 # Propositional clauses after purity: 0
% 21.70/3.22 # Propositional unsat core size : 0
% 21.70/3.22 # Propositional preprocessing time : 0.000
% 21.70/3.22 # Propositional encoding time : 0.000
% 21.70/3.22 # Propositional solver time : 0.000
% 21.70/3.22 # Success case prop preproc time : 0.000
% 21.70/3.22 # Success case prop encoding time : 0.000
% 21.70/3.22 # Success case prop solver time : 0.000
% 21.70/3.22 # Current number of processed clauses : 3046
% 21.70/3.22 # Positive orientable unit clauses : 245
% 21.70/3.22 # Positive unorientable unit clauses: 0
% 21.70/3.22 # Negative unit clauses : 105
% 21.70/3.22 # Non-unit-clauses : 2696
% 21.70/3.22 # Current number of unprocessed clauses: 161815
% 21.70/3.22 # ...number of literals in the above : 579105
% 21.70/3.22 # Current number of archived formulas : 0
% 21.70/3.22 # Current number of archived clauses : 438
% 21.70/3.22 # Clause-clause subsumption calls (NU) : 4739804
% 21.70/3.22 # Rec. Clause-clause subsumption calls : 1857698
% 21.70/3.22 # Non-unit clause-clause subsumptions : 31654
% 21.70/3.22 # Unit Clause-clause subsumption calls : 41608
% 21.70/3.22 # Rewrite failures with RHS unbound : 0
% 21.70/3.22 # BW rewrite match attempts : 44897
% 21.70/3.22 # BW rewrite match successes : 12
% 21.70/3.22 # Condensation attempts : 0
% 21.70/3.22 # Condensation successes : 0
% 21.70/3.22 # Termbank termtop insertions : 3504880
% 21.70/3.22 # Search garbage collected termcells : 8
% 21.70/3.22
% 21.70/3.22 # -------------------------------------------------
% 21.70/3.22 # User time : 2.555 s
% 21.70/3.22 # System time : 0.085 s
% 21.70/3.22 # Total time : 2.640 s
% 21.70/3.22 # Maximum resident set size: 1660 pages
% 21.70/3.22
% 21.70/3.22 # -------------------------------------------------
% 21.70/3.22 # User time : 13.200 s
% 21.70/3.22 # System time : 0.251 s
% 21.70/3.22 # Total time : 13.451 s
% 21.70/3.22 # Maximum resident set size: 1692 pages
% 21.70/3.22 % E---3.1 exiting
% 21.70/3.22 % E exiting
%------------------------------------------------------------------------------