%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX190-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:12 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.55s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 9 RR)
% Number of literals : 25 ( 24 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 27 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_044,axiom,
d(x(X1,X2)) = x(d(X1),d(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_044) ).
cnf(axiom_046,axiom,
d(x2) = n(s(z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_046) ).
cnf(axiom_043,axiom,
d(n(X1)) = n(z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_043) ).
cnf(axiom_063,axiom,
prop4(X1) = eq2(opt(d(X1)),opt(d(opt(X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_063) ).
cnf(axiom_052,axiom,
opt(x(n(z),X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_052) ).
cnf(goal,negated_conjecture,
eq3(prop4(X1),bfalse) != btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(axiom_074,axiom,
eq2(x(X1,X2),n(X3)) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_074) ).
cnf(axiom_088,axiom,
eq3(X1,X1) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_088) ).
cnf(c_0_8,axiom,
d(x(X1,X2)) = x(d(X1),d(X2)),
axiom_044 ).
cnf(c_0_9,axiom,
d(x2) = n(s(z)),
axiom_046 ).
cnf(c_0_10,axiom,
d(n(X1)) = n(z),
axiom_043 ).
cnf(c_0_11,plain,
x(d(X1),n(s(z))) = d(x(X1,x2)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
prop4(X1) = eq2(opt(d(X1)),opt(d(opt(X1)))),
axiom_063 ).
cnf(c_0_13,axiom,
opt(x(n(z),X1)) = X1,
axiom_052 ).
cnf(c_0_14,plain,
d(x(n(X1),X2)) = x(n(z),d(X2)),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_15,plain,
d(x(X1,n(X2))) = x(d(X1),n(z)),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_16,plain,
x(n(s(z)),n(s(z))) = d(x(x2,x2)),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
eq3(prop4(X1),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_18,plain,
eq2(d(X1),opt(d(X1))) = prop4(x(n(z),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_13]) ).
cnf(c_0_19,plain,
d(d(x(x2,x2))) = x(n(z),n(z)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_10]) ).
cnf(c_0_20,axiom,
eq2(x(X1,X2),n(X3)) = bfalse,
axiom_074 ).
cnf(c_0_21,negated_conjecture,
eq3(prop4(X1),bfalse) != btrue,
c_0_17 ).
cnf(c_0_22,plain,
prop4(x(n(z),d(x(x2,x2)))) = bfalse,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13]),c_0_20]) ).
cnf(c_0_23,axiom,
eq3(X1,X1) = btrue,
axiom_088 ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX190-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 10:31:05 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.45 Running first-order theorem proving
% 0.14/0.45 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
% 0.14/0.55 % Version: 3.5.1
% 0.14/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.55 % Starting sh5l with 300s (1) cores
% 0.14/0.55 % new_bool_3 with pid 3837573 completed with status 0
% 0.14/0.55 % Result found by new_bool_3
% 0.14/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.55 % Search class: FHUPM-FFMS31-MFFFFFNN
% 0.14/0.55 % partial match(1): FHUNM-FFMS31-MFFFFFNN
% 0.14/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.55 % SubtermCWHack with pid 3837577 completed with status 0
% 0.14/0.55 % Result found by SubtermCWHack
% 0.14/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.55 % Search class: FHUPM-FFMS31-MFFFFFNN
% 0.14/0.55 % partial match(1): FHUNM-FFMS31-MFFFFFNN
% 0.14/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.55 % Preprocessing time : 0.002 s
% 0.14/0.55
% 0.14/0.55 % Proof found!
% 0.14/0.55 % SZS status Unsatisfiable
% 0.14/0.55 % SZS output start CNFRefutation
% See solution above
% 0.14/0.55 % Parsed axioms : 90
% 0.14/0.55 % Removed by relevancy pruning/SinE : 31
% 0.14/0.55 % Initial clauses : 59
% 0.14/0.55 % Removed in clause preprocessing : 0
% 0.14/0.55 % Initial clauses in saturation : 59
% 0.14/0.55 % Processed clauses : 414
% 0.14/0.55 % ...of these trivial : 123
% 0.14/0.55 % ...subsumed : 14
% 0.14/0.55 % ...remaining for further processing : 277
% 0.14/0.55 % Other redundant clauses eliminated : 0
% 0.14/0.55 % Clauses deleted for lack of memory : 0
% 0.14/0.55 % Backward-subsumed : 0
% 0.14/0.55 % Backward-rewritten : 35
% 0.14/0.55 % Generated clauses : 1696
% 0.14/0.55 % ...of the previous two non-redundant : 1206
% 0.14/0.55 % ...aggressively subsumed : 0
% 0.14/0.55 % Contextual simplify-reflections : 0
% 0.14/0.55 % Paramodulations : 1696
% 0.14/0.55 % Factorizations : 0
% 0.14/0.55 % NegExts : 0
% 0.14/0.55 % Equation resolutions : 0
% 0.14/0.55 % Disequality decompositions : 0
% 0.14/0.55 % Total rewrite steps : 1282
% 0.14/0.55 % ...of those cached : 669
% 0.14/0.55 % Propositional unsat checks : 0
% 0.14/0.55 % Propositional check models : 0
% 0.14/0.55 % Propositional check unsatisfiable : 0
% 0.14/0.55 % Propositional clauses : 0
% 0.14/0.55 % Propositional clauses after purity: 0
% 0.14/0.55 % Propositional unsat core size : 0
% 0.14/0.55 % Propositional preprocessing time : 0.000
% 0.14/0.55 % Propositional encoding time : 0.000
% 0.14/0.55 % Propositional solver time : 0.000
% 0.14/0.55 % Success case prop preproc time : 0.000
% 0.14/0.55 % Success case prop encoding time : 0.000
% 0.14/0.55 % Success case prop solver time : 0.000
% 0.14/0.55 % Current number of processed clauses : 242
% 0.14/0.55 % Positive orientable unit clauses : 232
% 0.14/0.55 % Positive unorientable unit clauses: 4
% 0.14/0.55 % Negative unit clauses : 2
% 0.14/0.55 % Non-unit-clauses : 4
% 0.14/0.55 % Current number of unprocessed clauses: 838
% 0.14/0.55 % ...number of literals in the above : 894
% 0.14/0.55 % Current number of archived formulas : 0
% 0.14/0.55 % Current number of archived clauses : 35
% 0.14/0.55 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.55 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.55 % Non-unit clause-clause subsumptions : 0
% 0.14/0.55 % Unit Clause-clause subsumption calls : 1
% 0.14/0.55 % Rewrite failures with RHS unbound : 40
% 0.14/0.55 % BW rewrite match attempts : 495
% 0.14/0.55 % BW rewrite match successes : 52
% 0.14/0.55 % Condensation attempts : 0
% 0.14/0.55 % Condensation successes : 0
% 0.14/0.55 % Termbank termtop insertions : 20894
% 0.14/0.55 % Search garbage collected termcells : 107
% 0.14/0.55
% 0.14/0.55 % -------------------------------------------------
% 0.14/0.55 % User time : 0.044 s
% 0.14/0.55 % System time : 0.009 s
% 0.14/0.55 % Total time : 0.053 s
% 0.14/0.55 % Maximum resident set size: 3688 pages
% 0.14/0.55
% 0.14/0.55 % -------------------------------------------------
% 0.14/0.55 % User time : 0.048 s
% 0.14/0.55 % System time : 0.016 s
% 0.14/0.55 % Total time : 0.064 s
% 0.14/0.55 % Maximum resident set size: 4864 pages
% 0.14/0.55 % E exiting
%------------------------------------------------------------------------------