TSTP Solution File: LCL378-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL378-1 : TPTP v8.2.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:11 EDT 2024
% Result : Unsatisfiable 10.98s 1.90s
% Output : CNFRefutation 10.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of clauses : 63 ( 31 unt; 0 nHn; 21 RR)
% Number of literals : 107 ( 0 equ; 48 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 149 ( 39 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',cn_1) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
cnf(prove_cn_36,negated_conjecture,
~ is_a_theorem(implies(not(x),implies(x,y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_36) ).
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(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_11,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_10]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_13,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_14,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_11]) ).
cnf(c_0_15,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_11]) ).
cnf(c_0_16,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_12]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_18,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_14,c_0_8]) ).
cnf(c_0_19,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_15,c_0_10]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_24,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_18,c_0_12]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(implies(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_23]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,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_13,c_0_26]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(implies(not(X1),X1),implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(not(implies(X1,X3)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_27,c_0_7]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_33,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_29,c_0_26]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(implies(not(X1),X1),X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_36,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_15,c_0_7]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_39,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_40,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X3)) ),
inference(spm,[status(thm)],[c_0_33,c_0_12]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(not(implies(X1,X1)),X2)),
inference(spm,[status(thm)],[c_0_24,c_0_10]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(X1,implies(not(implies(not(X1),X2)),X3))),
inference(spm,[status(thm)],[c_0_19,c_0_34]) ).
cnf(c_0_43,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X3),X3)))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_35]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,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_38,c_0_39]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X3)))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(not(implies(X1,implies(not(X1),X2))),X3)),
inference(spm,[status(thm)],[c_0_24,c_0_42]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(implies(not(X1),X2),X3))
| ~ is_a_theorem(implies(implies(implies(X2,X1),X1),X3)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_21,c_0_47]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_45,c_0_50]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,X1)),X3))),
inference(spm,[status(thm)],[c_0_19,c_0_51]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(implies(implies(not(not(X1)),X2),X1),X1)),
inference(spm,[status(thm)],[c_0_16,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
~ is_a_theorem(implies(not(x),implies(x,y))),
inference(fof_simplification,[status(thm)],[prove_cn_36]) ).
cnf(c_0_56,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_53]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(implies(not(X1),not(not(X1))),X1)),
inference(spm,[status(thm)],[c_0_48,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
~ is_a_theorem(implies(not(x),implies(x,y))),
c_0_55 ).
cnf(c_0_59,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
~ is_a_theorem(implies(x,not(not(x)))),
inference(spm,[status(thm)],[c_0_58,c_0_17]) ).
cnf(c_0_61,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_21,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL378-1 : TPTP v8.2.0. Released v2.3.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 00:32:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 10.98/1.89 # Version: 3.1.0
% 10.98/1.89 # Preprocessing class: FSSSSMSSSSSNFFN.
% 10.98/1.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.98/1.89 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.98/1.89 # Starting new_bool_3 with 300s (1) cores
% 10.98/1.89 # Starting new_bool_1 with 300s (1) cores
% 10.98/1.89 # Starting sh5l with 300s (1) cores
% 10.98/1.89 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19109 completed with status 0
% 10.98/1.89 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 10.98/1.89 # Preprocessing class: FSSSSMSSSSSNFFN.
% 10.98/1.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.98/1.89 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.98/1.89 # No SInE strategy applied
% 10.98/1.89 # Search class: FHUNS-FFSF21-MFFFFFNN
% 10.98/1.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 10.98/1.89 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 10.98/1.89 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 10.98/1.89 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 10.98/1.89 # Starting new_bool_3 with 136s (1) cores
% 10.98/1.89 # Starting new_bool_1 with 136s (1) cores
% 10.98/1.89 # H----_011_C07_F1_PI_SE_SP_S0V with pid 19117 completed with status 0
% 10.98/1.90 # Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 10.98/1.90 # Preprocessing class: FSSSSMSSSSSNFFN.
% 10.98/1.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.98/1.90 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.98/1.90 # No SInE strategy applied
% 10.98/1.90 # Search class: FHUNS-FFSF21-MFFFFFNN
% 10.98/1.90 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 10.98/1.90 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 10.98/1.90 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 10.98/1.90 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 10.98/1.90 # Preprocessing time : 0.001 s
% 10.98/1.90
% 10.98/1.90 # Proof found!
% 10.98/1.90 # SZS status Unsatisfiable
% 10.98/1.90 # SZS output start CNFRefutation
% See solution above
% 10.98/1.90 # Parsed axioms : 5
% 10.98/1.90 # Removed by relevancy pruning/SinE : 0
% 10.98/1.90 # Initial clauses : 5
% 10.98/1.90 # Removed in clause preprocessing : 0
% 10.98/1.90 # Initial clauses in saturation : 5
% 10.98/1.90 # Processed clauses : 17189
% 10.98/1.90 # ...of these trivial : 670
% 10.98/1.90 # ...subsumed : 15142
% 10.98/1.90 # ...remaining for further processing : 1377
% 10.98/1.90 # Other redundant clauses eliminated : 0
% 10.98/1.90 # Clauses deleted for lack of memory : 0
% 10.98/1.90 # Backward-subsumed : 25
% 10.98/1.90 # Backward-rewritten : 25
% 10.98/1.90 # Generated clauses : 156406
% 10.98/1.90 # ...of the previous two non-redundant : 144319
% 10.98/1.90 # ...aggressively subsumed : 0
% 10.98/1.90 # Contextual simplify-reflections : 0
% 10.98/1.90 # Paramodulations : 156406
% 10.98/1.90 # Factorizations : 0
% 10.98/1.90 # NegExts : 0
% 10.98/1.90 # Equation resolutions : 0
% 10.98/1.90 # Disequality decompositions : 0
% 10.98/1.90 # Total rewrite steps : 13358
% 10.98/1.90 # ...of those cached : 11656
% 10.98/1.90 # Propositional unsat checks : 0
% 10.98/1.90 # Propositional check models : 0
% 10.98/1.90 # Propositional check unsatisfiable : 0
% 10.98/1.90 # Propositional clauses : 0
% 10.98/1.90 # Propositional clauses after purity: 0
% 10.98/1.90 # Propositional unsat core size : 0
% 10.98/1.90 # Propositional preprocessing time : 0.000
% 10.98/1.90 # Propositional encoding time : 0.000
% 10.98/1.90 # Propositional solver time : 0.000
% 10.98/1.90 # Success case prop preproc time : 0.000
% 10.98/1.90 # Success case prop encoding time : 0.000
% 10.98/1.90 # Success case prop solver time : 0.000
% 10.98/1.90 # Current number of processed clauses : 1327
% 10.98/1.90 # Positive orientable unit clauses : 283
% 10.98/1.90 # Positive unorientable unit clauses: 0
% 10.98/1.90 # Negative unit clauses : 15
% 10.98/1.90 # Non-unit-clauses : 1029
% 10.98/1.90 # Current number of unprocessed clauses: 127010
% 10.98/1.90 # ...number of literals in the above : 381179
% 10.98/1.90 # Current number of archived formulas : 0
% 10.98/1.90 # Current number of archived clauses : 50
% 10.98/1.90 # Clause-clause subsumption calls (NU) : 335981
% 10.98/1.90 # Rec. Clause-clause subsumption calls : 296395
% 10.98/1.90 # Non-unit clause-clause subsumptions : 15144
% 10.98/1.90 # Unit Clause-clause subsumption calls : 11381
% 10.98/1.90 # Rewrite failures with RHS unbound : 0
% 10.98/1.90 # BW rewrite match attempts : 48078
% 10.98/1.90 # BW rewrite match successes : 25
% 10.98/1.90 # Condensation attempts : 0
% 10.98/1.90 # Condensation successes : 0
% 10.98/1.90 # Termbank termtop insertions : 2528270
% 10.98/1.90 # Search garbage collected termcells : 8
% 10.98/1.90
% 10.98/1.90 # -------------------------------------------------
% 10.98/1.90 # User time : 1.296 s
% 10.98/1.90 # System time : 0.053 s
% 10.98/1.90 # Total time : 1.349 s
% 10.98/1.90 # Maximum resident set size: 1648 pages
% 10.98/1.90
% 10.98/1.90 # -------------------------------------------------
% 10.98/1.90 # User time : 6.612 s
% 10.98/1.90 # System time : 0.167 s
% 10.98/1.90 # Total time : 6.778 s
% 10.98/1.90 # Maximum resident set size: 1692 pages
% 10.98/1.90 % E---3.1 exiting
% 10.98/1.90 % E exiting
%------------------------------------------------------------------------------