%------------------------------------------------------------------------------
% File : E-SAT---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 : n020.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:41 PM UTC 2026
% Result : Theorem 0.13s 0.47s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 32 unt; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 11 ( 11 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 10 sgn 18 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_039,axiom,
! [X5] : d(n(X5)) = n(z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_039) ).
fof(goal_054,conjecture,
? [X6] : opt(d(X6)) != opt(d(opt(X6))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_054) ).
fof(axiom_042,axiom,
d(x2) = n(s(z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_042) ).
fof(axiom_050,axiom,
! [X6] : opt(x(n(z),X6)) = X6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_050) ).
fof(axiom_040,axiom,
! [X20,X21] : d(x(X20,X21)) = x(d(X20),d(X21)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_040) ).
fof(axiom_008,axiom,
! [X1,X2,X3] : n(X1) != x(X2,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_008) ).
fof(c_0_6,plain,
! [X29] : d(n(X29)) = n(z),
inference(variable_rename,[status(thm)],[axiom_039]) ).
fof(c_0_7,negated_conjecture,
~ ? [X6] : opt(d(X6)) != opt(d(opt(X6))),
inference(assume_negation,[status(cth)],[goal_054]) ).
cnf(c_0_8,plain,
d(n(X1)) = n(z),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
d(x2) = n(s(z)),
inference(split_conjunct,[status(thm)],[axiom_042]) ).
fof(c_0_10,negated_conjecture,
~ ? [X6] : opt(d(X6)) != opt(d(opt(X6))),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X27] : opt(x(n(z),X27)) = X27,
inference(variable_rename,[status(thm)],[axiom_050]) ).
cnf(c_0_12,plain,
n(z) = d(d(x2)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
fof(c_0_13,negated_conjecture,
! [X26] : opt(d(X26)) = opt(d(opt(X26))),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
cnf(c_0_14,plain,
opt(x(n(z),X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X30,X31] : d(x(X30,X31)) = x(d(X30),d(X31)),
inference(variable_rename,[status(thm)],[axiom_040]) ).
cnf(c_0_16,plain,
d(n(X1)) = d(d(x2)),
inference(rw,[status(thm)],[c_0_8,c_0_12]) ).
fof(c_0_17,plain,
! [X1,X2,X3] : n(X1) != x(X2,X3),
inference(fof_simplification,[status(thm)],[axiom_008]) ).
cnf(c_0_18,negated_conjecture,
opt(d(X1)) = opt(d(opt(X1))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
opt(x(d(d(x2)),X1)) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_20,plain,
d(x(X1,X2)) = x(d(X1),d(X2)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
d(d(d(x2))) = d(d(x2)),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
fof(c_0_22,plain,
! [X34,X35,X36] : n(X34) != x(X35,X36),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_17])]) ).
cnf(c_0_23,negated_conjecture,
opt(d(x(d(d(x2)),X1))) = opt(d(X1)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
d(x(d(d(x2)),X1)) = d(x(d(x2),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_20]) ).
cnf(c_0_25,plain,
opt(d(x(d(x2),X1))) = d(X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
n(X1) != x(X2,X3),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
opt(d(X1)) = d(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,plain,
n(X1) != d(x(X2,X3)),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_29,plain,
d(x(d(x2),X1)) = d(X1),
inference(rw,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_30,plain,
n(X1) != d(X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX190+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n020.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 10:32:04 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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.13/0.47 % Version: 3.5.1
% 0.13/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.47 % Starting sh5l with 300s (1) cores
% 0.13/0.47 % new_bool_3 with pid 2695430 completed with status 0
% 0.13/0.47 % Result found by new_bool_3
% 0.13/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.47 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.13/0.47 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.47 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.47 % SubtermCWHack with pid 2695433 completed with status 0
% 0.13/0.47 % Result found by SubtermCWHack
% 0.13/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.47 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.13/0.47 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.47 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.47 % Preprocessing time : 0.002 s
% 0.13/0.47
% 0.13/0.47 % Proof found!
% 0.13/0.47 % SZS status Theorem
% 0.13/0.47 % SZS output start CNFRefutation
% See solution above
% 0.13/0.47 % Parsed axioms : 54
% 0.13/0.47 % Removed by relevancy pruning/SinE : 40
% 0.13/0.47 % Initial clauses : 14
% 0.13/0.47 % Removed in clause preprocessing : 0
% 0.13/0.47 % Initial clauses in saturation : 14
% 0.13/0.47 % Processed clauses : 101
% 0.13/0.47 % ...of these trivial : 0
% 0.13/0.47 % ...subsumed : 34
% 0.13/0.47 % ...remaining for further processing : 67
% 0.13/0.47 % Other redundant clauses eliminated : 0
% 0.13/0.47 % Clauses deleted for lack of memory : 0
% 0.13/0.47 % Backward-subsumed : 20
% 0.13/0.47 % Backward-rewritten : 8
% 0.13/0.47 % Generated clauses : 224
% 0.13/0.47 % ...of the previous two non-redundant : 206
% 0.13/0.47 % ...aggressively subsumed : 0
% 0.13/0.47 % Contextual simplify-reflections : 0
% 0.13/0.47 % Paramodulations : 222
% 0.13/0.47 % Factorizations : 0
% 0.13/0.47 % NegExts : 0
% 0.13/0.47 % Equation resolutions : 0
% 0.13/0.47 % Disequality decompositions : 0
% 0.13/0.47 % Total rewrite steps : 93
% 0.13/0.47 % ...of those cached : 48
% 0.13/0.47 % Propositional unsat checks : 0
% 0.13/0.47 % Propositional check models : 0
% 0.13/0.47 % Propositional check unsatisfiable : 0
% 0.13/0.47 % Propositional clauses : 0
% 0.13/0.47 % Propositional clauses after purity: 0
% 0.13/0.47 % Propositional unsat core size : 0
% 0.13/0.47 % Propositional preprocessing time : 0.000
% 0.13/0.47 % Propositional encoding time : 0.000
% 0.13/0.47 % Propositional solver time : 0.000
% 0.13/0.47 % Success case prop preproc time : 0.000
% 0.13/0.47 % Success case prop encoding time : 0.000
% 0.13/0.47 % Success case prop solver time : 0.000
% 0.13/0.47 % Current number of processed clauses : 37
% 0.13/0.47 % Positive orientable unit clauses : 12
% 0.13/0.47 % Positive unorientable unit clauses: 0
% 0.13/0.47 % Negative unit clauses : 25
% 0.13/0.47 % Non-unit-clauses : 0
% 0.13/0.47 % Current number of unprocessed clauses: 119
% 0.13/0.47 % ...number of literals in the above : 119
% 0.13/0.47 % Current number of archived formulas : 0
% 0.13/0.47 % Current number of archived clauses : 30
% 0.13/0.47 % Clause-clause subsumption calls (NU) : 0
% 0.13/0.47 % Rec. Clause-clause subsumption calls : 0
% 0.13/0.47 % Non-unit clause-clause subsumptions : 0
% 0.13/0.47 % Unit Clause-clause subsumption calls : 176
% 0.13/0.47 % Rewrite failures with RHS unbound : 0
% 0.13/0.47 % BW rewrite match attempts : 17
% 0.13/0.47 % BW rewrite match successes : 11
% 0.13/0.47 % Condensation attempts : 0
% 0.13/0.47 % Condensation successes : 0
% 0.13/0.47 % Termbank termtop insertions : 3171
% 0.13/0.47 % Search garbage collected termcells : 321
% 0.13/0.47
% 0.13/0.47 % -------------------------------------------------
% 0.13/0.47 % User time : 0.008 s
% 0.13/0.47 % System time : 0.006 s
% 0.13/0.47 % Total time : 0.014 s
% 0.13/0.47 % Maximum resident set size: 3636 pages
% 0.13/0.47
% 0.13/0.47 % -------------------------------------------------
% 0.13/0.47 % User time : 0.011 s
% 0.13/0.47 % System time : 0.013 s
% 0.13/0.47 % Total time : 0.024 s
% 0.13/0.47 % Maximum resident set size: 4864 pages
% 0.13/0.47 % E exiting
%------------------------------------------------------------------------------