%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX204+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:15 PM UTC 2026
% Result : Theorem 0.08s 0.41s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 30 unt; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 9 ( 9 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 36 ( 2 sgn 18 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_004,axiom,
! [X2,X3] : x2(s(X3),X2) = s(x2(X3,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_004) ).
fof(axiom_006,axiom,
! [X2,X3] : x22(s(X3),X2) = x2(X2,x22(X3,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_006) ).
fof(goal_007,conjecture,
? [X1] : x22(X1,X1) != X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_007) ).
fof(axiom_001,axiom,
! [X1] : proj1S(s(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_001) ).
fof(axiom_005,axiom,
! [X2] : x22(z,X2) = z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_005) ).
fof(axiom_003,axiom,
! [X2] : x2(z,X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_003) ).
fof(axiom_002,axiom,
! [X1] : z != s(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_002) ).
fof(c_0_7,plain,
! [X7,X8] : x2(s(X8),X7) = s(x2(X8,X7)),
inference(variable_rename,[status(thm)],[axiom_004]) ).
fof(c_0_8,plain,
! [X10,X11] : x22(s(X11),X10) = x2(X10,x22(X11,X10)),
inference(variable_rename,[status(thm)],[axiom_006]) ).
fof(c_0_9,negated_conjecture,
~ ? [X1] : x22(X1,X1) != X1,
inference(assume_negation,[status(cth)],[goal_007]) ).
fof(c_0_10,plain,
! [X4] : proj1S(s(X4)) = X4,
inference(variable_rename,[status(thm)],[axiom_001]) ).
cnf(c_0_11,plain,
x2(s(X1),X2) = s(x2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
x22(s(X1),X2) = x2(X2,x22(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,negated_conjecture,
~ ? [X1] : x22(X1,X1) != X1,
inference(fof_simplification,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
proj1S(s(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
s(x2(X1,x22(X2,s(X1)))) = x22(s(X2),s(X1)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,negated_conjecture,
! [X12] : x22(X12,X12) = X12,
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
fof(c_0_17,plain,
! [X9] : x22(z,X9) = z,
inference(variable_rename,[status(thm)],[axiom_005]) ).
cnf(c_0_18,plain,
proj1S(x22(s(X1),s(X2))) = x2(X2,x22(X1,s(X2))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
x22(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
x22(z,X1) = z,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X6] : x2(z,X6) = X6,
inference(variable_rename,[status(thm)],[axiom_003]) ).
fof(c_0_22,plain,
! [X1] : z != s(X1),
inference(fof_simplification,[status(thm)],[axiom_002]) ).
cnf(c_0_23,negated_conjecture,
x2(X1,x22(X1,s(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_14]) ).
cnf(c_0_24,plain,
x22(s(z),X1) = x2(X1,z),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_25,plain,
x2(z,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_26,plain,
! [X5] : z != s(X5),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
s(s(s(z))) = s(z),
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_23,c_0_24]),c_0_11]),c_0_11]),c_0_25]),c_0_11]),c_0_25]) ).
cnf(c_0_28,plain,
z != s(X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_27]),c_0_14]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX204+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.08/0.35 % Computer : n007.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 10:31:35 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.39 Running first-order theorem proving
% 0.08/0.39 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.08/0.41 % Version: 3.5.1
% 0.08/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.41 % Starting sh5l with 300s (1) cores
% 0.08/0.41 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 855836 completed with status 0
% 0.08/0.41 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.08/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.41 % No SInE strategy applied
% 0.08/0.41 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.08/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.08/0.41 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.08/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.08/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.08/0.41 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 855841 completed with status 0
% 0.08/0.41 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.08/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.41 % No SInE strategy applied
% 0.08/0.41 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.08/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.08/0.41 % Preprocessing time : 0.001 s
% 0.08/0.41
% 0.08/0.41 % Proof found!
% 0.08/0.41 % SZS status Theorem
% 0.08/0.41 % SZS output start CNFRefutation
% See solution above
% 0.08/0.41 % Parsed axioms : 7
% 0.08/0.41 % Removed by relevancy pruning/SinE : 0
% 0.08/0.41 % Initial clauses : 7
% 0.08/0.41 % Removed in clause preprocessing : 0
% 0.08/0.41 % Initial clauses in saturation : 7
% 0.08/0.41 % Processed clauses : 27
% 0.08/0.41 % ...of these trivial : 0
% 0.08/0.41 % ...subsumed : 6
% 0.08/0.41 % ...remaining for further processing : 21
% 0.08/0.41 % Other redundant clauses eliminated : 0
% 0.08/0.41 % Clauses deleted for lack of memory : 0
% 0.08/0.41 % Backward-subsumed : 0
% 0.08/0.41 % Backward-rewritten : 0
% 0.08/0.41 % Generated clauses : 131
% 0.08/0.41 % ...of the previous two non-redundant : 82
% 0.08/0.41 % ...aggressively subsumed : 0
% 0.08/0.41 % Contextual simplify-reflections : 0
% 0.08/0.41 % Paramodulations : 131
% 0.08/0.41 % Factorizations : 0
% 0.08/0.41 % NegExts : 0
% 0.08/0.41 % Equation resolutions : 0
% 0.08/0.41 % Disequality decompositions : 0
% 0.08/0.41 % Total rewrite steps : 115
% 0.08/0.41 % ...of those cached : 70
% 0.08/0.41 % Propositional unsat checks : 0
% 0.08/0.41 % Propositional check models : 0
% 0.08/0.41 % Propositional check unsatisfiable : 0
% 0.08/0.41 % Propositional clauses : 0
% 0.08/0.41 % Propositional clauses after purity: 0
% 0.08/0.41 % Propositional unsat core size : 0
% 0.08/0.41 % Propositional preprocessing time : 0.000
% 0.08/0.41 % Propositional encoding time : 0.000
% 0.08/0.41 % Propositional solver time : 0.000
% 0.08/0.41 % Success case prop preproc time : 0.000
% 0.08/0.41 % Success case prop encoding time : 0.000
% 0.08/0.41 % Success case prop solver time : 0.000
% 0.08/0.41 % Current number of processed clauses : 21
% 0.08/0.41 % Positive orientable unit clauses : 16
% 0.08/0.41 % Positive unorientable unit clauses: 1
% 0.08/0.41 % Negative unit clauses : 4
% 0.08/0.41 % Non-unit-clauses : 0
% 0.08/0.41 % Current number of unprocessed clauses: 61
% 0.08/0.41 % ...number of literals in the above : 61
% 0.08/0.41 % Current number of archived formulas : 0
% 0.08/0.41 % Current number of archived clauses : 0
% 0.08/0.41 % Clause-clause subsumption calls (NU) : 0
% 0.08/0.41 % Rec. Clause-clause subsumption calls : 0
% 0.08/0.41 % Non-unit clause-clause subsumptions : 0
% 0.08/0.41 % Unit Clause-clause subsumption calls : 1
% 0.08/0.41 % Rewrite failures with RHS unbound : 0
% 0.08/0.41 % BW rewrite match attempts : 6
% 0.08/0.41 % BW rewrite match successes : 1
% 0.08/0.41 % Condensation attempts : 0
% 0.08/0.41 % Condensation successes : 0
% 0.08/0.41 % Termbank termtop insertions : 1741
% 0.08/0.41 % Search garbage collected termcells : 14
% 0.08/0.41
% 0.08/0.41 % -------------------------------------------------
% 0.08/0.41 % User time : 0.004 s
% 0.08/0.41 % System time : 0.003 s
% 0.08/0.41 % Total time : 0.006 s
% 0.08/0.41 % Maximum resident set size: 3632 pages
% 0.08/0.41
% 0.08/0.41 % -------------------------------------------------
% 0.08/0.41 % User time : 0.010 s
% 0.08/0.41 % System time : 0.012 s
% 0.08/0.41 % Total time : 0.022 s
% 0.08/0.41 % Maximum resident set size: 4608 pages
% 0.08/0.41 % E exiting
%------------------------------------------------------------------------------