%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN353-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:23:48 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 12
% Syntax : Number of clauses : 62 ( 7 unt; 29 nHn; 40 RR)
% Number of literals : 161 ( 0 equ; 69 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-3 aty)
% Number of variables : 147 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause1,negated_conjecture,
( ~ f(a,a,z(X1,X2,X3))
| ~ f(X1,X2,X3)
| f(X3,X1,X2)
| f(X2,X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause4,negated_conjecture,
( f(X3,X2,z(X2,X3,X1))
| f(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
cnf(clause10,negated_conjecture,
( ~ f(z(X2,X3,X1),X3,X2)
| f(X2,X3,X1)
| f(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).
cnf(clause6,negated_conjecture,
( ~ f(X3,z(X3,X1,X2),X1)
| ~ f(X1,X2,X3)
| f(X3,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
cnf(clause11,negated_conjecture,
( ~ f(z(X3,X1,X2),X1,X3)
| f(X3,X1,X2)
| f(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause11) ).
cnf(clause8,negated_conjecture,
( f(X3,z(X3,X1,X2),X1)
| f(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
cnf(clause2,negated_conjecture,
( ~ f(X3,X2,z(X2,X3,X1))
| ~ f(X1,X2,X3)
| f(X2,X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(clause12,negated_conjecture,
( ~ f(X3,X1,X2)
| ~ f(X1,X2,X3)
| f(z(X2,X3,X1),X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause12) ).
cnf(clause3,negated_conjecture,
( ~ f(X3,X2,z(X2,X3,X1))
| ~ f(X1,X2,X3)
| f(X3,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause7,negated_conjecture,
( ~ f(X3,z(X3,X1,X2),X1)
| ~ f(X1,X2,X3)
| f(X2,X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
cnf(clause5,negated_conjecture,
( ~ f(X2,X3,X1)
| ~ f(X1,X2,X3)
| f(X2,X1,z(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(clause17,negated_conjecture,
( ~ f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))
| ~ f(X3,X1,X2)
| ~ f(X2,X3,X1)
| ~ f(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause17) ).
cnf(c_0_12,negated_conjecture,
( ~ f(a,a,z(X1,X2,X3))
| ~ f(X1,X2,X3)
| f(X3,X1,X2)
| f(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[clause1]) ).
cnf(c_0_13,negated_conjecture,
( ~ f(a,a,z(X1,X2,X3))
| ~ f(X1,X2,X3)
| f(X3,X1,X2)
| f(X2,X3,X1) ),
c_0_12 ).
cnf(c_0_14,negated_conjecture,
( f(X3,X2,z(X2,X3,X1))
| f(X1,X2,X3) ),
clause4 ).
cnf(c_0_15,negated_conjecture,
( ~ f(z(X2,X3,X1),X3,X2)
| f(X2,X3,X1)
| f(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause10]) ).
cnf(c_0_16,negated_conjecture,
( ~ f(a,a,X1)
| f(a,X1,a)
| f(X1,a,a) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( ~ f(X3,z(X3,X1,X2),X1)
| ~ f(X1,X2,X3)
| f(X3,X1,X2) ),
inference(fof_simplification,[status(thm)],[clause6]) ).
cnf(c_0_18,negated_conjecture,
( ~ f(z(X2,X3,X1),X3,X2)
| f(X2,X3,X1)
| f(X1,X2,X3) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
( f(X1,a,a)
| f(z(a,a,X1),a,a)
| f(a,z(a,a,X1),a) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( ~ f(X3,z(X3,X1,X2),X1)
| ~ f(X1,X2,X3)
| f(X3,X1,X2) ),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
( f(X1,a,a)
| f(a,a,X1)
| f(a,z(a,a,X1),a) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( ~ f(z(X3,X1,X2),X1,X3)
| f(X3,X1,X2)
| f(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause11]) ).
cnf(c_0_23,negated_conjecture,
( ~ f(a,X1,a)
| f(a,a,X1)
| f(X1,a,a) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( f(X3,z(X3,X1,X2),X1)
| f(X1,X2,X3) ),
clause8 ).
cnf(c_0_25,negated_conjecture,
( ~ f(X3,X2,z(X2,X3,X1))
| ~ f(X1,X2,X3)
| f(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[clause2]) ).
cnf(c_0_26,negated_conjecture,
( ~ f(z(X3,X1,X2),X1,X3)
| f(X3,X1,X2)
| f(X1,X2,X3) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
( f(a,X1,a)
| f(z(a,a,X1),a,a)
| f(a,a,z(a,a,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( ~ f(X3,X2,z(X2,X3,X1))
| ~ f(X1,X2,X3)
| f(X2,X3,X1) ),
c_0_25 ).
cnf(c_0_29,negated_conjecture,
( f(a,X1,a)
| f(a,a,X1)
| f(a,a,z(a,a,X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( ~ f(X3,X1,X2)
| ~ f(X1,X2,X3)
| f(z(X2,X3,X1),X3,X2) ),
inference(fof_simplification,[status(thm)],[clause12]) ).
cnf(c_0_31,negated_conjecture,
( ~ f(X1,a,a)
| f(a,a,X1)
| f(a,X1,a) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( ~ f(X3,X1,X2)
| ~ f(X1,X2,X3)
| f(z(X2,X3,X1),X3,X2) ),
c_0_30 ).
cnf(c_0_33,negated_conjecture,
( f(a,z(a,a,X1),a)
| f(a,a,z(a,a,X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_14]),c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( f(a,a,X1)
| f(a,a,z(a,a,X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_33]),c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( ~ f(X3,X2,z(X2,X3,X1))
| ~ f(X1,X2,X3)
| f(X3,X1,X2) ),
inference(fof_simplification,[status(thm)],[clause3]) ).
cnf(c_0_36,negated_conjecture,
( ~ f(X1,a,a)
| f(a,a,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( f(z(a,a,X1),a,a)
| f(a,a,z(a,a,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( ~ f(X3,X2,z(X2,X3,X1))
| ~ f(X1,X2,X3)
| f(X3,X1,X2) ),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
f(a,a,z(a,a,X1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( ~ f(X3,z(X3,X1,X2),X1)
| ~ f(X1,X2,X3)
| f(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[clause7]) ).
cnf(c_0_41,negated_conjecture,
( ~ f(X1,a,a)
| f(a,X1,a) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
( ~ f(X3,z(X3,X1,X2),X1)
| ~ f(X1,X2,X3)
| f(X2,X3,X1) ),
c_0_40 ).
cnf(c_0_43,negated_conjecture,
( f(X1,a,a)
| f(a,z(a,a,X1),a) ),
inference(spm,[status(thm)],[c_0_41,c_0_19]) ).
cnf(c_0_44,negated_conjecture,
( ~ f(a,X1,a)
| f(X1,a,a) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,negated_conjecture,
( f(a,X1,a)
| f(z(a,a,X1),a,a) ),
inference(spm,[status(thm)],[c_0_44,c_0_24]) ).
cnf(c_0_46,negated_conjecture,
( f(a,X1,a)
| f(a,a,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_45]) ).
cnf(c_0_47,negated_conjecture,
f(a,a,X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_46]),c_0_36]) ).
cnf(c_0_48,negated_conjecture,
( ~ f(X2,X3,X1)
| f(X3,X1,X2)
| f(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_47])]) ).
cnf(c_0_49,negated_conjecture,
( ~ f(X2,X3,X1)
| ~ f(X1,X2,X3)
| f(X2,X1,z(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[clause5]) ).
cnf(c_0_50,negated_conjecture,
( f(X2,z(X2,X1,X3),X1)
| f(X1,X2,z(X2,X1,X3)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_32]),c_0_14]),c_0_24]) ).
cnf(c_0_51,negated_conjecture,
( ~ f(X2,X3,X1)
| ~ f(X1,X2,X3)
| f(X2,X1,z(X1,X2,X3)) ),
c_0_49 ).
cnf(c_0_52,negated_conjecture,
( ~ f(X1,X3,X2)
| f(X1,X2,z(X2,X1,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_50]),c_0_51]) ).
cnf(c_0_53,negated_conjecture,
( ~ f(X3,X1,X2)
| f(X1,X2,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_52]),c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( f(X2,X1,z(X1,X2,X3))
| f(z(X1,X2,X3),X2,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
f(X1,X2,z(X2,X1,X3)),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
f(X1,z(X1,X2,X3),X2),
inference(spm,[status(thm)],[c_0_53,c_0_55]) ).
cnf(c_0_57,negated_conjecture,
( ~ f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))
| ~ f(X3,X1,X2)
| ~ f(X2,X3,X1)
| ~ f(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause17]) ).
cnf(c_0_58,negated_conjecture,
f(z(X1,X2,X3),X2,X1),
inference(spm,[status(thm)],[c_0_53,c_0_56]) ).
cnf(c_0_59,negated_conjecture,
( ~ f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))
| ~ f(X3,X1,X2)
| ~ f(X2,X3,X1)
| ~ f(X1,X2,X3) ),
c_0_57 ).
cnf(c_0_60,negated_conjecture,
f(X1,X2,X3),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_58])]),c_0_53]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60]),c_0_60]),c_0_60]),c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN353-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 10:52:48 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.15/0.43 % Version: 3.5.1
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % Starting sh5l with 300s (1) cores
% 0.15/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4109977 completed with status 0
% 0.15/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.43 % No SInE strategy applied
% 0.15/0.43 % Search class: FGHNF-FFMF33-SFFFFFNN
% 0.15/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.43 % SubtermCWHack with pid 4109982 completed with status 0
% 0.15/0.43 % Result found by SubtermCWHack
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.43 % No SInE strategy applied
% 0.15/0.43 % Search class: FGHNF-FFMF33-SFFFFFNN
% 0.15/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.43 % Preprocessing time : 0.001 s
% 0.15/0.43
% 0.15/0.43 % Proof found!
% 0.15/0.43 % SZS status Unsatisfiable
% 0.15/0.43 % SZS output start CNFRefutation
% See solution above
% 0.15/0.43 % Parsed axioms : 17
% 0.15/0.43 % Removed by relevancy pruning/SinE : 0
% 0.15/0.43 % Initial clauses : 17
% 0.15/0.43 % Removed in clause preprocessing : 0
% 0.15/0.43 % Initial clauses in saturation : 17
% 0.15/0.43 % Processed clauses : 79
% 0.15/0.43 % ...of these trivial : 4
% 0.15/0.43 % ...subsumed : 21
% 0.15/0.43 % ...remaining for further processing : 54
% 0.15/0.43 % Other redundant clauses eliminated : 0
% 0.15/0.43 % Clauses deleted for lack of memory : 0
% 0.15/0.43 % Backward-subsumed : 23
% 0.15/0.43 % Backward-rewritten : 30
% 0.15/0.43 % Generated clauses : 165
% 0.15/0.43 % ...of the previous two non-redundant : 118
% 0.15/0.43 % ...aggressively subsumed : 0
% 0.15/0.43 % Contextual simplify-reflections : 12
% 0.15/0.43 % Paramodulations : 163
% 0.15/0.43 % Factorizations : 2
% 0.15/0.43 % NegExts : 0
% 0.15/0.43 % Equation resolutions : 0
% 0.15/0.43 % Disequality decompositions : 0
% 0.15/0.43 % Total rewrite steps : 84
% 0.15/0.43 % ...of those cached : 55
% 0.15/0.43 % Propositional unsat checks : 0
% 0.15/0.43 % Propositional check models : 0
% 0.15/0.43 % Propositional check unsatisfiable : 0
% 0.15/0.43 % Propositional clauses : 0
% 0.15/0.43 % Propositional clauses after purity: 0
% 0.15/0.43 % Propositional unsat core size : 0
% 0.15/0.43 % Propositional preprocessing time : 0.000
% 0.15/0.43 % Propositional encoding time : 0.000
% 0.15/0.43 % Propositional solver time : 0.000
% 0.15/0.43 % Success case prop preproc time : 0.000
% 0.15/0.43 % Success case prop encoding time : 0.000
% 0.15/0.43 % Success case prop solver time : 0.000
% 0.15/0.43 % Current number of processed clauses : 1
% 0.15/0.43 % Positive orientable unit clauses : 1
% 0.15/0.43 % Positive unorientable unit clauses: 0
% 0.15/0.43 % Negative unit clauses : 0
% 0.15/0.43 % Non-unit-clauses : 0
% 0.15/0.43 % Current number of unprocessed clauses: 14
% 0.15/0.43 % ...number of literals in the above : 30
% 0.15/0.43 % Current number of archived formulas : 0
% 0.15/0.43 % Current number of archived clauses : 53
% 0.15/0.43 % Clause-clause subsumption calls (NU) : 479
% 0.15/0.43 % Rec. Clause-clause subsumption calls : 421
% 0.15/0.43 % Non-unit clause-clause subsumptions : 45
% 0.15/0.43 % Unit Clause-clause subsumption calls : 39
% 0.15/0.43 % Rewrite failures with RHS unbound : 0
% 0.15/0.43 % BW rewrite match attempts : 50
% 0.15/0.43 % BW rewrite match successes : 27
% 0.15/0.43 % Condensation attempts : 0
% 0.15/0.43 % Condensation successes : 0
% 0.15/0.43 % Termbank termtop insertions : 2841
% 0.15/0.43 % Search garbage collected termcells : 31
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.005 s
% 0.15/0.43 % System time : 0.002 s
% 0.15/0.43 % Total time : 0.007 s
% 0.15/0.43 % Maximum resident set size: 3384 pages
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.019 s
% 0.15/0.43 % System time : 0.009 s
% 0.15/0.43 % Total time : 0.028 s
% 0.15/0.43 % Maximum resident set size: 4608 pages
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------