%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX207-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 : n015.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:16 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 31 ( 28 unt; 0 nHn; 13 RR)
% Number of literals : 34 ( 33 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 6 con; 0-2 aty)
% Number of variables : 47 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
eq5(unambig(X1,X2),bfalse) != btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(axiom_037,axiom,
( eq3(X1,X2) != bfalse
| eq4(c2(X1,X3),c2(X2,X4)) = bfalse ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_037) ).
cnf(axiom_010,axiom,
unambig(X1,X2) = impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_010) ).
cnf(axiom_018,axiom,
eq3(pE,pB) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_018) ).
cnf(axiom_009,axiom,
linC(c2(X1,X2)) = append(linP(X1),linP(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_009) ).
cnf(axiom_008,axiom,
linP(pE) = nil,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_008) ).
cnf(axiom_002,axiom,
append(nil,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_002) ).
cnf(axiom_007,axiom,
linP(pB) = cons(b,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_007) ).
cnf(axiom_003,axiom,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_003) ).
cnf(axiom_039,axiom,
eq(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_039) ).
cnf(axiom,axiom,
impl(btrue,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom) ).
cnf(axiom_043,axiom,
eq5(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_043) ).
cnf(c_0_12,negated_conjecture,
eq5(unambig(X1,X2),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_13,plain,
( eq3(X1,X2) != bfalse
| eq4(c2(X1,X3),c2(X2,X4)) = bfalse ),
inference(fof_simplification,[status(thm)],[axiom_037]) ).
cnf(c_0_14,negated_conjecture,
eq5(unambig(X1,X2),bfalse) != btrue,
c_0_12 ).
cnf(c_0_15,axiom,
unambig(X1,X2) = impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),
axiom_010 ).
cnf(c_0_16,plain,
( eq3(X1,X2) != bfalse
| eq4(c2(X1,X3),c2(X2,X4)) = bfalse ),
c_0_13 ).
cnf(c_0_17,axiom,
eq3(pE,pB) = bfalse,
axiom_018 ).
cnf(c_0_18,negated_conjecture,
eq5(impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),bfalse) != btrue,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
eq4(c2(pE,X1),c2(pB,X2)) = bfalse,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
linC(c2(X1,X2)) = append(linP(X1),linP(X2)),
axiom_009 ).
cnf(c_0_21,axiom,
linP(pE) = nil,
axiom_008 ).
cnf(c_0_22,axiom,
append(nil,X1) = X1,
axiom_002 ).
cnf(c_0_23,axiom,
linP(pB) = cons(b,nil),
axiom_007 ).
cnf(c_0_24,axiom,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
axiom_003 ).
cnf(c_0_25,negated_conjecture,
eq5(impl(eq(linP(X1),cons(b,linP(X2))),bfalse),bfalse) != btrue,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22]),c_0_20]),c_0_23]),c_0_24]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
eq5(impl(eq(linP(X1),cons(b,nil)),bfalse),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_27,axiom,
eq(X1,X1) = btrue,
axiom_039 ).
cnf(c_0_28,axiom,
impl(btrue,X1) = X1,
axiom ).
cnf(c_0_29,axiom,
eq5(X1,X1) = btrue,
axiom_043 ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_23]),c_0_27]),c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX207-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 10:36:06 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 0.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1249616 completed with status 0
% 0.11/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.11/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FHUPM-FFMM21-MFFFFFNN
% 0.11/0.44 % partial match(1): FHUPM-FFMF21-MFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.11/0.44 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.11/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1249622 completed with status 0
% 0.11/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.11/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FHUPM-FFMM21-MFFFFFNN
% 0.11/0.44 % partial match(1): FHUPM-FFMF21-MFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44 % Presaturation interreduction done
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Unsatisfiable
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 49
% 0.11/0.44 % Removed by relevancy pruning/SinE : 0
% 0.11/0.44 % Initial clauses : 49
% 0.11/0.44 % Removed in clause preprocessing : 1
% 0.11/0.44 % Initial clauses in saturation : 48
% 0.11/0.44 % Processed clauses : 155
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 33
% 0.11/0.44 % ...remaining for further processing : 122
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 0
% 0.11/0.44 % Backward-rewritten : 0
% 0.11/0.44 % Generated clauses : 178
% 0.11/0.44 % ...of the previous two non-redundant : 168
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 178
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 305
% 0.11/0.44 % ...of those cached : 239
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 74
% 0.11/0.44 % Positive orientable unit clauses : 56
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 14
% 0.11/0.44 % Non-unit-clauses : 4
% 0.11/0.44 % Current number of unprocessed clauses: 108
% 0.11/0.44 % ...number of literals in the above : 126
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 49
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.11/0.44 % Non-unit clause-clause subsumptions : 0
% 0.11/0.44 % Unit Clause-clause subsumption calls : 60
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 20
% 0.11/0.44 % BW rewrite match successes : 0
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 3760
% 0.11/0.44 % Search garbage collected termcells : 14
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.010 s
% 0.11/0.44 % System time : 0.003 s
% 0.11/0.44 % Total time : 0.012 s
% 0.11/0.44 % Maximum resident set size: 3596 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.035 s
% 0.11/0.44 % System time : 0.019 s
% 0.11/0.44 % Total time : 0.053 s
% 0.11/0.44 % Maximum resident set size: 4864 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------