TSTP Solution File: LDA004-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LDA004-1 : TPTP v8.2.0. Released v1.0.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 : Tue May 21 00:37:10 EDT 2024
% Result : Unsatisfiable 184.37s 23.79s
% Output : CNFRefutation 184.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 60 ( 54 unt; 0 nHn; 34 RR)
% Number of literals : 70 ( 40 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 58 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a3,axiom,
( left(X1,X3)
| ~ left(X1,X2)
| ~ left(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3) ).
cnf(a2,axiom,
left(X1,f(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2) ).
cnf(a1,axiom,
f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1) ).
cnf(clause_7,axiom,
u1 = f(u,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_5,axiom,
n3 = f(n2,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_4,axiom,
n2 = f(n1,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_10,axiom,
a = f(f(n3,n2),u2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_8,axiom,
u2 = f(u,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_9,axiom,
u3 = f(u,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_6,axiom,
u = f(n2,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_11,axiom,
b = f(u1,u3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
cnf(prove_equation,negated_conjecture,
~ left(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equation) ).
cnf(c_0_12,plain,
( left(X1,X3)
| ~ left(X1,X2)
| ~ left(X2,X3) ),
inference(fof_simplification,[status(thm)],[a3]) ).
cnf(c_0_13,axiom,
left(X1,f(X1,X2)),
a2 ).
cnf(c_0_14,axiom,
f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)),
a1 ).
cnf(c_0_15,axiom,
u1 = f(u,n1),
clause_7 ).
cnf(c_0_16,axiom,
n3 = f(n2,n1),
clause_5 ).
cnf(c_0_17,axiom,
n2 = f(n1,n1),
clause_4 ).
cnf(c_0_18,plain,
( left(X1,X3)
| ~ left(X1,X2)
| ~ left(X2,X3) ),
c_0_12 ).
cnf(c_0_19,plain,
left(f(X1,X2),f(X1,f(X2,X3))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,axiom,
a = f(f(n3,n2),u2),
clause_10 ).
cnf(c_0_21,plain,
f(f(u,X1),u1) = f(u,f(X1,n1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,axiom,
u2 = f(u,n2),
clause_8 ).
cnf(c_0_23,axiom,
u3 = f(u,n3),
clause_9 ).
cnf(c_0_24,plain,
f(f(n2,X1),n3) = f(n2,f(X1,n1)),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_25,axiom,
u = f(n2,n2),
clause_6 ).
cnf(c_0_26,plain,
f(f(n1,X1),n2) = f(n1,f(X1,n1)),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_27,plain,
( left(X1,f(X2,X3))
| ~ left(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_28,plain,
left(a,f(f(n3,n2),f(u2,X1))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
f(u2,u1) = u3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16]),c_0_23]) ).
cnf(c_0_30,plain,
f(n3,n3) = u,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_17]),c_0_25]) ).
cnf(c_0_31,plain,
f(f(n2,X1),u) = f(n2,f(X1,n2)),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_32,plain,
f(n1,n2) = u,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_17]),c_0_25]),c_0_17]) ).
cnf(c_0_33,plain,
( left(X1,f(X2,X3))
| ~ left(X1,X4)
| ~ left(X4,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_34,plain,
left(a,f(f(n3,n2),u3)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
left(f(X1,f(X2,X3)),f(X1,f(X2,f(X3,X4)))),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_36,plain,
f(u,f(n3,X1)) = f(n3,f(n3,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_37,plain,
f(n2,f(n1,X1)) = f(n1,f(n1,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_38,plain,
f(n2,u) = f(n3,u),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_16]),c_0_32]) ).
cnf(c_0_39,plain,
( left(a,f(X1,X2))
| ~ left(f(f(n3,n2),u3),X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
left(f(X1,u3),f(X1,f(n3,f(n3,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_23]),c_0_36]) ).
cnf(c_0_41,plain,
f(n3,f(n2,X1)) = f(n1,f(n1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_37]) ).
cnf(c_0_42,plain,
f(f(n1,X1),u) = f(n1,f(X1,n2)),
inference(spm,[status(thm)],[c_0_14,c_0_32]) ).
cnf(c_0_43,plain,
f(n1,n3) = u2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_32]),c_0_22]),c_0_16]) ).
cnf(c_0_44,plain,
f(u,u) = f(n3,u),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_25]),c_0_38]) ).
cnf(c_0_45,plain,
f(n3,u) = f(n1,u),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_32]),c_0_38]) ).
cnf(c_0_46,plain,
left(a,f(f(n1,f(n1,f(n3,X1))),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_14]),c_0_41]) ).
cnf(c_0_47,plain,
f(n1,f(n3,n2)) = f(u2,u),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
f(f(X1,f(X2,X3)),f(f(X1,X2),X4)) = f(f(X1,X2),f(f(X1,X3),X4)),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_49,plain,
f(u,u) = f(n1,u),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
left(a,f(f(n1,f(u2,u)),X1)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
f(f(X1,u2),f(f(X1,u),X2)) = f(f(X1,u),f(f(X1,n2),X2)),
inference(spm,[status(thm)],[c_0_48,c_0_22]) ).
cnf(c_0_52,plain,
f(f(n1,u),f(u,X1)) = f(u,f(u,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_49]) ).
cnf(c_0_53,plain,
f(f(u,X1),u3) = f(u,f(X1,n3)),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_54,axiom,
b = f(u1,u3),
clause_11 ).
cnf(c_0_55,negated_conjecture,
~ left(a,b),
inference(fof_simplification,[status(thm)],[prove_equation]) ).
cnf(c_0_56,plain,
left(a,f(u,f(u,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_48]),c_0_51]),c_0_32]),c_0_52]) ).
cnf(c_0_57,plain,
f(u,u2) = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_15]),c_0_54]),c_0_43]) ).
cnf(c_0_58,negated_conjecture,
~ left(a,b),
c_0_55 ).
cnf(c_0_59,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_22]),c_0_57]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LDA004-1 : TPTP v8.2.0. Released v1.0.0.
% 0.11/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 : Sat May 18 11:52:37 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/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
% 184.37/23.79 # Version: 3.1.0
% 184.37/23.79 # Preprocessing class: FSSSSMSMSSSNFFN.
% 184.37/23.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 184.37/23.79 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 184.37/23.79 # Starting new_bool_3 with 300s (1) cores
% 184.37/23.79 # Starting new_bool_1 with 300s (1) cores
% 184.37/23.79 # Starting sh5l with 300s (1) cores
% 184.37/23.79 # new_bool_3 with pid 31433 completed with status 0
% 184.37/23.79 # Result found by new_bool_3
% 184.37/23.79 # Preprocessing class: FSSSSMSMSSSNFFN.
% 184.37/23.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 184.37/23.79 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 184.37/23.79 # Starting new_bool_3 with 300s (1) cores
% 184.37/23.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 184.37/23.79 # Search class: FHUSS-FFSM22-SFFFFFNN
% 184.37/23.79 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 184.37/23.79 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 181s (1) cores
% 184.37/23.79 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 31440 completed with status 0
% 184.37/23.79 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 184.37/23.79 # Preprocessing class: FSSSSMSMSSSNFFN.
% 184.37/23.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 184.37/23.79 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 184.37/23.79 # Starting new_bool_3 with 300s (1) cores
% 184.37/23.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 184.37/23.79 # Search class: FHUSS-FFSM22-SFFFFFNN
% 184.37/23.79 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 184.37/23.79 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 181s (1) cores
% 184.37/23.79 # Preprocessing time : 0.001 s
% 184.37/23.79
% 184.37/23.79 # Proof found!
% 184.37/23.79 # SZS status Unsatisfiable
% 184.37/23.79 # SZS output start CNFRefutation
% See solution above
% 184.37/23.79 # Parsed axioms : 12
% 184.37/23.79 # Removed by relevancy pruning/SinE : 0
% 184.37/23.79 # Initial clauses : 12
% 184.37/23.79 # Removed in clause preprocessing : 0
% 184.37/23.79 # Initial clauses in saturation : 12
% 184.37/23.79 # Processed clauses : 47868
% 184.37/23.79 # ...of these trivial : 13489
% 184.37/23.79 # ...subsumed : 18013
% 184.37/23.79 # ...remaining for further processing : 16366
% 184.37/23.79 # Other redundant clauses eliminated : 0
% 184.37/23.79 # Clauses deleted for lack of memory : 0
% 184.37/23.79 # Backward-subsumed : 455
% 184.37/23.79 # Backward-rewritten : 3296
% 184.37/23.79 # Generated clauses : 2535783
% 184.37/23.79 # ...of the previous two non-redundant : 1757286
% 184.37/23.79 # ...aggressively subsumed : 0
% 184.37/23.79 # Contextual simplify-reflections : 12
% 184.37/23.79 # Paramodulations : 2535783
% 184.37/23.79 # Factorizations : 0
% 184.37/23.79 # NegExts : 0
% 184.37/23.79 # Equation resolutions : 0
% 184.37/23.79 # Disequality decompositions : 0
% 184.37/23.79 # Total rewrite steps : 1493256
% 184.37/23.79 # ...of those cached : 1267148
% 184.37/23.79 # Propositional unsat checks : 0
% 184.37/23.79 # Propositional check models : 0
% 184.37/23.79 # Propositional check unsatisfiable : 0
% 184.37/23.79 # Propositional clauses : 0
% 184.37/23.79 # Propositional clauses after purity: 0
% 184.37/23.79 # Propositional unsat core size : 0
% 184.37/23.79 # Propositional preprocessing time : 0.000
% 184.37/23.79 # Propositional encoding time : 0.000
% 184.37/23.79 # Propositional solver time : 0.000
% 184.37/23.79 # Success case prop preproc time : 0.000
% 184.37/23.79 # Success case prop encoding time : 0.000
% 184.37/23.79 # Success case prop solver time : 0.000
% 184.37/23.79 # Current number of processed clauses : 12615
% 184.37/23.79 # Positive orientable unit clauses : 9417
% 184.37/23.79 # Positive unorientable unit clauses: 3
% 184.37/23.79 # Negative unit clauses : 9
% 184.37/23.79 # Non-unit-clauses : 3186
% 184.37/23.79 # Current number of unprocessed clauses: 1700770
% 184.37/23.79 # ...number of literals in the above : 3791338
% 184.37/23.79 # Current number of archived formulas : 0
% 184.37/23.79 # Current number of archived clauses : 3751
% 184.37/23.79 # Clause-clause subsumption calls (NU) : 1607486
% 184.37/23.79 # Rec. Clause-clause subsumption calls : 1301403
% 184.37/23.79 # Non-unit clause-clause subsumptions : 16487
% 184.37/23.79 # Unit Clause-clause subsumption calls : 3473
% 184.37/23.79 # Rewrite failures with RHS unbound : 0
% 184.37/23.79 # BW rewrite match attempts : 382261
% 184.37/23.79 # BW rewrite match successes : 2856
% 184.37/23.79 # Condensation attempts : 0
% 184.37/23.79 # Condensation successes : 0
% 184.37/23.79 # Termbank termtop insertions : 41163514
% 184.37/23.79 # Search garbage collected termcells : 8
% 184.37/23.79
% 184.37/23.79 # -------------------------------------------------
% 184.37/23.79 # User time : 22.130 s
% 184.37/23.79 # System time : 0.922 s
% 184.37/23.79 # Total time : 23.052 s
% 184.37/23.79 # Maximum resident set size: 1628 pages
% 184.37/23.79
% 184.37/23.79 # -------------------------------------------------
% 184.37/23.79 # User time : 22.130 s
% 184.37/23.79 # System time : 0.925 s
% 184.37/23.79 # Total time : 23.056 s
% 184.37/23.79 # Maximum resident set size: 1696 pages
% 184.37/23.79 % E---3.1 exiting
% 184.37/23.79 % E exiting
%------------------------------------------------------------------------------