%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX185-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:14:11 PM UTC 2026
% Result : Unsatisfiable 4.44s 6.22s
% Output : CNFRefutation 4.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 49 ( 45 unt; 0 nHn; 17 RR)
% Number of literals : 53 ( 52 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-2 aty)
% Number of variables : 68 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_006,axiom,
assoc(x2(X1,X2)) = x2(assoc(X1),assoc(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_006) ).
cnf(axiom_008,axiom,
assoc(eY) = eY,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_008) ).
cnf(axiom_016,axiom,
lin(x2(X1,X2)) = append(lin(X1),append(cons(mul,nil),lin(X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_016) ).
cnf(axiom_010,axiom,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_010) ).
cnf(axiom_009,axiom,
append(nil,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_009) ).
cnf(axiom_056,axiom,
( eq3(X1,X2) != bfalse
| eq3(x2(X1,X3),x2(X2,X4)) = bfalse ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_056) ).
cnf(axiom_018,axiom,
lin(eY) = cons(y,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_018) ).
cnf(axiom_007,axiom,
assoc(eX) = eX,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_007) ).
cnf(goal,negated_conjecture,
eq4(prop_unambig(X1,X2),bfalse) != btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(axiom_063,axiom,
eq3(x2(X1,X2),eY) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_063) ).
cnf(axiom_019,axiom,
prop_unambig(X1,X2) = impl(eq(lin(X1),lin(X2)),eq3(assoc(X1),assoc(X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_019) ).
cnf(axiom_068,axiom,
eq(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_068) ).
cnf(axiom,axiom,
impl(btrue,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom) ).
cnf(axiom_071,axiom,
eq4(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_071) ).
cnf(c_0_14,axiom,
assoc(x2(X1,X2)) = x2(assoc(X1),assoc(X2)),
axiom_006 ).
cnf(c_0_15,axiom,
assoc(eY) = eY,
axiom_008 ).
cnf(c_0_16,axiom,
lin(x2(X1,X2)) = append(lin(X1),append(cons(mul,nil),lin(X2))),
axiom_016 ).
cnf(c_0_17,axiom,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
axiom_010 ).
cnf(c_0_18,axiom,
append(nil,X1) = X1,
axiom_009 ).
cnf(c_0_19,plain,
( eq3(X1,X2) != bfalse
| eq3(x2(X1,X3),x2(X2,X4)) = bfalse ),
inference(fof_simplification,[status(thm)],[axiom_056]) ).
cnf(c_0_20,plain,
x2(assoc(X1),eY) = assoc(x2(X1,eY)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
append(lin(X1),cons(mul,lin(X2))) = lin(x2(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_22,axiom,
lin(eY) = cons(y,nil),
axiom_018 ).
cnf(c_0_23,plain,
( eq3(X1,X2) != bfalse
| eq3(x2(X1,X3),x2(X2,X4)) = bfalse ),
c_0_19 ).
cnf(c_0_24,plain,
x2(eY,assoc(X1)) = assoc(x2(eY,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_25,plain,
assoc(x2(eY,eY)) = x2(eY,eY),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_26,axiom,
assoc(eX) = eX,
axiom_007 ).
cnf(c_0_27,negated_conjecture,
eq4(prop_unambig(X1,X2),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_28,plain,
cons(y,cons(mul,lin(X1))) = lin(x2(eY,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17]),c_0_18]) ).
cnf(c_0_29,plain,
( eq3(X1,eY) != bfalse
| eq3(x2(X1,X2),assoc(x2(eY,X3))) = bfalse ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
x2(x2(eY,eY),assoc(X1)) = assoc(x2(x2(eY,eY),X1)),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_31,axiom,
eq3(x2(X1,X2),eY) = bfalse,
axiom_063 ).
cnf(c_0_32,plain,
x2(assoc(X1),eX) = assoc(x2(X1,eX)),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
eq4(prop_unambig(X1,X2),bfalse) != btrue,
c_0_27 ).
cnf(c_0_34,axiom,
prop_unambig(X1,X2) = impl(eq(lin(X1),lin(X2)),eq3(assoc(X1),assoc(X2))),
axiom_019 ).
cnf(c_0_35,plain,
cons(y,cons(mul,append(lin(X1),X2))) = append(lin(x2(eY,X1)),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_28]),c_0_17]) ).
cnf(c_0_36,plain,
eq3(assoc(x2(x2(eY,eY),X1)),assoc(x2(eY,X2))) = bfalse,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_37,plain,
assoc(x2(x2(eY,eY),eX)) = x2(x2(eY,eY),eX),
inference(spm,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_38,plain,
assoc(x2(eY,eX)) = x2(eY,eX),
inference(spm,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_39,negated_conjecture,
eq4(impl(eq(lin(X1),lin(X2)),eq3(assoc(X1),assoc(X2))),bfalse) != btrue,
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
lin(x2(x2(eY,X1),X2)) = lin(x2(eY,x2(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_21]),c_0_28]),c_0_21]) ).
cnf(c_0_41,plain,
eq3(x2(x2(eY,eY),eX),assoc(x2(eY,X1))) = bfalse,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
assoc(x2(eY,x2(eY,eX))) = x2(eY,x2(eY,eX)),
inference(spm,[status(thm)],[c_0_24,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
eq4(impl(eq(lin(x2(eY,x2(eY,eX))),lin(X1)),eq3(x2(x2(eY,eY),eX),assoc(X1))),bfalse) != btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_37]),c_0_40]) ).
cnf(c_0_44,axiom,
eq(X1,X1) = btrue,
axiom_068 ).
cnf(c_0_45,plain,
eq3(x2(x2(eY,eY),eX),x2(eY,x2(eY,eX))) = bfalse,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,axiom,
impl(btrue,X1) = X1,
axiom ).
cnf(c_0_47,axiom,
eq4(X1,X1) = btrue,
axiom_071 ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_42]),c_0_44]),c_0_45]),c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX185-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.52 % Computer : n007.cluster.edu
% 0.11/5.52 % Model : x86_64 x86_64
% 0.11/5.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.52 % Memory : 8046.5625MB
% 0.11/5.52 % OS : Linux 6.8.0-71-generic
% 0.11/5.52 % CPULimit : 300
% 0.11/5.52 % WCLimit : 300
% 0.11/5.52 % DateTime : Mon Sep 21 10:28:56 UTC 2026
% 0.11/5.52 % CPUTime :
% 0.11/5.52 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.57 Running first-order theorem proving
% 0.11/5.57 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
% 4.44/6.22 % Version: 3.5.1
% 4.44/6.22 % Preprocessing class: FSMSSMSMSSSNFFN.
% 4.44/6.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.44/6.22 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 4.44/6.22 % Starting new_bool_3 with 300s (1) cores
% 4.44/6.22 % Starting new_bool_1 with 300s (1) cores
% 4.44/6.22 % Starting sh5l with 300s (1) cores
% 4.44/6.22 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 851979 completed with status 0
% 4.44/6.22 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 4.44/6.22 % Preprocessing class: FSMSSMSMSSSNFFN.
% 4.44/6.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.44/6.22 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 4.44/6.22 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.44/6.22 % No SInE strategy applied
% 4.44/6.22 % Search class: FHUPM-FFMM21-MFFFFFNN
% 4.44/6.22 % partial match(1): FHUPM-FFMF21-MFFFFFNN
% 4.44/6.22 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.44/6.22 % Starting SubtermCWHack with 136s (1) cores
% 4.44/6.22 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 4.44/6.22 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 4.44/6.22 % Starting new_bool_3 with 136s (1) cores
% 4.44/6.22 % Starting new_bool_1 with 136s (1) cores
% 4.44/6.22 % SubtermCWHack with pid 851984 completed with status 0
% 4.44/6.22 % Result found by SubtermCWHack
% 4.44/6.22 % Preprocessing class: FSMSSMSMSSSNFFN.
% 4.44/6.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.44/6.22 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 4.44/6.22 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.44/6.22 % No SInE strategy applied
% 4.44/6.22 % Search class: FHUPM-FFMM21-MFFFFFNN
% 4.44/6.22 % partial match(1): FHUPM-FFMF21-MFFFFFNN
% 4.44/6.22 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.44/6.22 % Starting SubtermCWHack with 136s (1) cores
% 4.44/6.22 % Preprocessing time : 0.002 s
% 4.44/6.22
% 4.44/6.22 % Proof found!
% 4.44/6.22 % SZS status Unsatisfiable
% 4.44/6.22 % SZS output start CNFRefutation
% See solution above
% 4.44/6.22 % Parsed axioms : 77
% 4.44/6.22 % Removed by relevancy pruning/SinE : 0
% 4.44/6.22 % Initial clauses : 77
% 4.44/6.22 % Removed in clause preprocessing : 1
% 4.44/6.22 % Initial clauses in saturation : 76
% 4.44/6.22 % Processed clauses : 4268
% 4.44/6.22 % ...of these trivial : 761
% 4.44/6.22 % ...subsumed : 1708
% 4.44/6.22 % ...remaining for further processing : 1799
% 4.44/6.22 % Other redundant clauses eliminated : 0
% 4.44/6.22 % Clauses deleted for lack of memory : 0
% 4.44/6.22 % Backward-subsumed : 4
% 4.44/6.22 % Backward-rewritten : 492
% 4.44/6.22 % Generated clauses : 67464
% 4.44/6.22 % ...of the previous two non-redundant : 43385
% 4.44/6.22 % ...aggressively subsumed : 0
% 4.44/6.22 % Contextual simplify-reflections : 0
% 4.44/6.22 % Paramodulations : 67464
% 4.44/6.22 % Factorizations : 0
% 4.44/6.22 % NegExts : 0
% 4.44/6.22 % Equation resolutions : 0
% 4.44/6.22 % Disequality decompositions : 0
% 4.44/6.22 % Total rewrite steps : 50644
% 4.44/6.22 % ...of those cached : 32264
% 4.44/6.22 % Propositional unsat checks : 0
% 4.44/6.22 % Propositional check models : 0
% 4.44/6.22 % Propositional check unsatisfiable : 0
% 4.44/6.22 % Propositional clauses : 0
% 4.44/6.22 % Propositional clauses after purity: 0
% 4.44/6.22 % Propositional unsat core size : 0
% 4.44/6.22 % Propositional preprocessing time : 0.000
% 4.44/6.22 % Propositional encoding time : 0.000
% 4.44/6.22 % Propositional solver time : 0.000
% 4.44/6.22 % Success case prop preproc time : 0.000
% 4.44/6.22 % Success case prop encoding time : 0.000
% 4.44/6.22 % Success case prop solver time : 0.000
% 4.44/6.22 % Current number of processed clauses : 1303
% 4.44/6.22 % Positive orientable unit clauses : 1212
% 4.44/6.22 % Positive unorientable unit clauses: 0
% 4.44/6.22 % Negative unit clauses : 27
% 4.44/6.22 % Non-unit-clauses : 64
% 4.44/6.22 % Current number of unprocessed clauses: 38715
% 4.44/6.22 % ...number of literals in the above : 45036
% 4.44/6.22 % Current number of archived formulas : 0
% 4.44/6.22 % Current number of archived clauses : 497
% 4.44/6.22 % Clause-clause subsumption calls (NU) : 341
% 4.44/6.22 % Rec. Clause-clause subsumption calls : 263
% 4.44/6.22 % Non-unit clause-clause subsumptions : 13
% 4.44/6.22 % Unit Clause-clause subsumption calls : 360
% 4.44/6.22 % Rewrite failures with RHS unbound : 0
% 4.44/6.22 % BW rewrite match attempts : 9035
% 4.44/6.22 % BW rewrite match successes : 490
% 4.44/6.22 % Condensation attempts : 0
% 4.44/6.22 % Condensation successes : 0
% 4.44/6.22 % Termbank termtop insertions : 1079486
% 4.44/6.22 % Search garbage collected termcells : 16
% 4.44/6.22
% 4.44/6.22 % -------------------------------------------------
% 4.44/6.22 % User time : 0.551 s
% 4.44/6.22 % System time : 0.057 s
% 4.44/6.22 % Total time : 0.608 s
% 4.44/6.22 % Maximum resident set size: 3676 pages
% 4.44/6.22
% 4.44/6.22 % -------------------------------------------------
% 4.44/6.22 % User time : 2.831 s
% 4.44/6.22 % System time : 0.222 s
% 4.44/6.22 % Total time : 3.053 s
% 4.44/6.22 % Maximum resident set size: 4864 pages
% 4.44/6.22 % E exiting
%------------------------------------------------------------------------------