TSTP Solution File: LDA002-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LDA002-1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:34:20 EDT 2023
% Result : Unsatisfiable 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of clauses : 61 ( 61 unt; 0 nHn; 45 RR)
% Number of literals : 61 ( 60 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 11 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a1,axiom,
f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p',a1) ).
cnf(clause_8,axiom,
uu = f(u,u),
file('/export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p',clause_8) ).
cnf(clause_11,axiom,
v = f(uu,uu),
file('/export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p',clause_11) ).
cnf(clause_7,axiom,
u3 = f(u,n3),
file('/export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p',clause_7) ).
cnf(clause_2,axiom,
n2 = f(n1,n1),
file('/export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p',clause_2) ).
cnf(clause_4,axiom,
u = f(n2,n2),
file('/export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p',clause_4) ).
cnf(clause_5,axiom,
u1 = f(u,n1),
file('/export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p',clause_5) ).
cnf(clause_10,axiom,
b = f(u1,u3),
file('/export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p',clause_10) ).
cnf(clause_6,axiom,
u2 = f(u,n2),
file('/export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p',clause_6) ).
cnf(clause_3,axiom,
n3 = f(n2,n1),
file('/export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p',clause_3) ).
cnf(clause_9,axiom,
a = f(f(n3,n2),u2),
file('/export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p',clause_9) ).
cnf(prove_equation,negated_conjecture,
f(a,v) != f(b,v),
file('/export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p',prove_equation) ).
cnf(c_0_12,axiom,
f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)),
a1 ).
cnf(c_0_13,axiom,
uu = f(u,u),
clause_8 ).
cnf(c_0_14,plain,
f(f(u,X1),uu) = f(u,f(X1,u)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
v = f(uu,uu),
clause_11 ).
cnf(c_0_16,axiom,
u3 = f(u,n3),
clause_7 ).
cnf(c_0_17,axiom,
n2 = f(n1,n1),
clause_2 ).
cnf(c_0_18,axiom,
u = f(n2,n2),
clause_4 ).
cnf(c_0_19,plain,
f(u,uu) = v,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_15]),c_0_13]) ).
cnf(c_0_20,plain,
f(f(u,X1),u3) = f(u,f(X1,n3)),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_21,axiom,
u1 = f(u,n1),
clause_5 ).
cnf(c_0_22,axiom,
b = f(u1,u3),
clause_10 ).
cnf(c_0_23,plain,
f(f(n1,X1),n2) = f(n1,f(X1,n1)),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_24,axiom,
u2 = f(u,n2),
clause_6 ).
cnf(c_0_25,plain,
f(f(n2,X1),u) = f(n2,f(X1,n2)),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_26,plain,
f(f(u,X1),v) = f(u,f(X1,uu)),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_27,plain,
f(u,f(n1,n3)) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_28,plain,
f(n1,n2) = u,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_17]),c_0_18]),c_0_17]) ).
cnf(c_0_29,axiom,
n3 = f(n2,n1),
clause_3 ).
cnf(c_0_30,axiom,
a = f(f(n3,n2),u2),
clause_9 ).
cnf(c_0_31,plain,
f(f(u,X1),u2) = f(u,f(X1,n2)),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_32,plain,
f(n2,u) = uu,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_18]),c_0_13]),c_0_18]) ).
cnf(c_0_33,plain,
f(n1,f(n1,X1)) = f(n2,f(n1,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_34,plain,
f(u,f(f(n1,n3),uu)) = f(b,v),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
f(n1,n3) = u2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_28]),c_0_24]),c_0_29]) ).
cnf(c_0_36,plain,
f(u,f(n2,u)) = f(u2,uu),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_37,plain,
f(f(f(n3,n2),X1),a) = f(f(n3,n2),f(X1,u2)),
inference(spm,[status(thm)],[c_0_12,c_0_30]) ).
cnf(c_0_38,plain,
f(u2,u2) = uu,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_24]),c_0_18]),c_0_13]) ).
cnf(c_0_39,plain,
f(n3,u) = uu,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_29]),c_0_28]),c_0_32]) ).
cnf(c_0_40,plain,
f(n3,f(n2,X1)) = f(n2,f(n1,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_29]) ).
cnf(c_0_41,plain,
f(n1,u) = uu,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_28]),c_0_32]) ).
cnf(c_0_42,plain,
f(u,f(n2,X1)) = f(n2,f(n2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_43,plain,
f(u,f(u2,uu)) = f(b,v),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_44,plain,
f(u2,uu) = v,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_32]),c_0_19]) ).
cnf(c_0_45,plain,
f(f(n3,n2),uu) = f(a,a),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_30]),c_0_38]) ).
cnf(c_0_46,plain,
f(f(n3,X1),uu) = f(n3,f(X1,u)),
inference(spm,[status(thm)],[c_0_12,c_0_39]) ).
cnf(c_0_47,plain,
f(n3,uu) = f(n2,uu),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_32]),c_0_41]) ).
cnf(c_0_48,plain,
f(n2,uu) = v,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_32]),c_0_19]) ).
cnf(c_0_49,plain,
f(f(uu,X1),v) = f(uu,f(X1,uu)),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_50,negated_conjecture,
f(a,v) != f(b,v),
prove_equation ).
cnf(c_0_51,plain,
f(b,v) = f(u,v),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,plain,
f(a,a) = v,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_32]),c_0_47]),c_0_48]) ).
cnf(c_0_53,plain,
f(v,f(u,X1)) = f(u,f(uu,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_54,plain,
f(v,v) = f(uu,v),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_15]),c_0_15]) ).
cnf(c_0_55,negated_conjecture,
f(a,v) != f(u,v),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
f(u,v) = f(n2,v),
inference(spm,[status(thm)],[c_0_42,c_0_48]) ).
cnf(c_0_57,plain,
f(a,f(a,X1)) = f(v,f(a,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_52]) ).
cnf(c_0_58,plain,
f(uu,v) = f(u,v),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_19]),c_0_54]),c_0_15]) ).
cnf(c_0_59,negated_conjecture,
f(a,v) != f(n2,v),
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_52]),c_0_54]),c_0_58]),c_0_56]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LDA002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n010.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 2400
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon Oct 2 19:23:05 EDT 2023
% 0.14/0.33 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.b9RoJUl8MU/E---3.1_27005.p
% 0.19/0.52 # Version: 3.1pre001
% 0.19/0.52 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # new_bool_3 with pid 27148 completed with status 0
% 0.19/0.52 # Result found by new_bool_3
% 0.19/0.52 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FUUPF-FFSM22-SFFFFFNN
% 0.19/0.52 # partial match(1): FUUPF-FFSF22-SFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.52 # SAT001_MinMin_p005000_rr_RG with pid 27153 completed with status 0
% 0.19/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.52 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FUUPF-FFSM22-SFFFFFNN
% 0.19/0.52 # partial match(1): FUUPF-FFSF22-SFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.52 # Preprocessing time : 0.001 s
% 0.19/0.52 # Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 # Proof found!
% 0.19/0.52 # SZS status Unsatisfiable
% 0.19/0.52 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 12
% 0.19/0.52 # Removed by relevancy pruning/SinE : 0
% 0.19/0.52 # Initial clauses : 12
% 0.19/0.52 # Removed in clause preprocessing : 0
% 0.19/0.52 # Initial clauses in saturation : 12
% 0.19/0.52 # Processed clauses : 321
% 0.19/0.52 # ...of these trivial : 42
% 0.19/0.52 # ...subsumed : 0
% 0.19/0.52 # ...remaining for further processing : 279
% 0.19/0.52 # Other redundant clauses eliminated : 0
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 0
% 0.19/0.52 # Backward-rewritten : 74
% 0.19/0.52 # Generated clauses : 3327
% 0.19/0.52 # ...of the previous two non-redundant : 2911
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 0
% 0.19/0.52 # Paramodulations : 3327
% 0.19/0.52 # Factorizations : 0
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 0
% 0.19/0.52 # Total rewrite steps : 3331
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 193
% 0.19/0.52 # Positive orientable unit clauses : 192
% 0.19/0.52 # Positive unorientable unit clauses: 0
% 0.19/0.52 # Negative unit clauses : 1
% 0.19/0.52 # Non-unit-clauses : 0
% 0.19/0.52 # Current number of unprocessed clauses: 2585
% 0.19/0.52 # ...number of literals in the above : 2585
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 86
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.52 # Non-unit clause-clause subsumptions : 0
% 0.19/0.52 # Unit Clause-clause subsumption calls : 0
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 77
% 0.19/0.52 # BW rewrite match successes : 50
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 56219
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.046 s
% 0.19/0.52 # System time : 0.005 s
% 0.19/0.52 # Total time : 0.051 s
% 0.19/0.52 # Maximum resident set size: 1636 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.047 s
% 0.19/0.52 # System time : 0.008 s
% 0.19/0.52 # Total time : 0.054 s
% 0.19/0.52 # Maximum resident set size: 1672 pages
% 0.19/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------