%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN563-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:25:37 PM UTC 2026
% Result : Unsatisfiable 2.08s 0.74s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 45 ( 45 unt; 0 nHn; 16 RR)
% Number of literals : 45 ( 44 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-4 aty)
% Number of variables : 61 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p6_16,negated_conjecture,
ifeq2(p2(X1,X2),true,ifeq2(p2(X3,X4),true,ifeq2(p6(X3,X1),true,p6(X4,X2),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p6_16) ).
cnf(p6_2,negated_conjecture,
p6(X1,X1) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p6_2) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(p6_10,negated_conjecture,
ifeq2(p5(X1,X2),true,p6(f4(X1),X2),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p6_10) ).
cnf(p5_7,negated_conjecture,
p5(f3(f3(X1)),f3(f4(X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p5_7) ).
cnf(p2_1,negated_conjecture,
p2(X1,X1) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_1) ).
cnf(p2_11,negated_conjecture,
ifeq2(p2(X1,X2),true,p2(f3(X1),f3(X2)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_11) ).
cnf(p2_4,negated_conjecture,
p2(f4(c7),f4(c8)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_4) ).
cnf(p6_9,negated_conjecture,
ifeq2(p6(c7,X1),true,p6(c7,f3(X1)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p6_9) ).
cnf(p6_14,negated_conjecture,
ifeq2(p6(X1,X2),true,ifeq2(p6(X3,X1),true,p6(X3,X2),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p6_14) ).
cnf(p5_15,negated_conjecture,
ifeq2(p6(X1,X2),true,ifeq2(p5(X2,X3),true,p5(X1,X3),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p5_15) ).
cnf(p5_8,negated_conjecture,
ifeq2(p6(f4(X1),X2),true,p5(X1,X2),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p5_8) ).
cnf(goal,negated_conjecture,
a != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(not_p6_5,negated_conjecture,
ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p6_5) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(c_0_15,negated_conjecture,
ifeq2(p2(X1,X2),true,ifeq2(p2(X3,X4),true,ifeq2(p6(X3,X1),true,p6(X4,X2),true),true),true) = true,
p6_16 ).
cnf(c_0_16,negated_conjecture,
p6(X1,X1) = true,
p6_2 ).
cnf(c_0_17,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_18,negated_conjecture,
ifeq2(p5(X1,X2),true,p6(f4(X1),X2),true) = true,
p6_10 ).
cnf(c_0_19,negated_conjecture,
p5(f3(f3(X1)),f3(f4(X1))) = true,
p5_7 ).
cnf(c_0_20,negated_conjecture,
ifeq2(p2(X1,X2),true,ifeq2(p2(X1,X3),true,p6(X3,X2),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
p2(X1,X1) = true,
p2_1 ).
cnf(c_0_22,negated_conjecture,
ifeq2(p2(X1,X2),true,p2(f3(X1),f3(X2)),true) = true,
p2_11 ).
cnf(c_0_23,negated_conjecture,
p2(f4(c7),f4(c8)) = true,
p2_4 ).
cnf(c_0_24,negated_conjecture,
ifeq2(p6(c7,X1),true,p6(c7,f3(X1)),true) = true,
p6_9 ).
cnf(c_0_25,negated_conjecture,
ifeq2(p6(X1,X2),true,ifeq2(p6(X3,X1),true,p6(X3,X2),true),true) = true,
p6_14 ).
cnf(c_0_26,negated_conjecture,
p6(f4(f3(f3(X1))),f3(f4(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
cnf(c_0_27,negated_conjecture,
ifeq2(p2(X1,X2),true,p6(X1,X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]) ).
cnf(c_0_28,negated_conjecture,
p2(f3(f4(c7)),f3(f4(c8))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17]) ).
cnf(c_0_29,negated_conjecture,
p6(c7,f3(c7)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_17]) ).
cnf(c_0_30,negated_conjecture,
ifeq2(p6(f3(f4(X1)),X2),true,p6(f4(f3(f3(X1))),X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17]) ).
cnf(c_0_31,negated_conjecture,
p6(f3(f4(c7)),f3(f4(c8))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_17]) ).
cnf(c_0_32,negated_conjecture,
ifeq2(p6(X1,X2),true,ifeq2(p5(X2,X3),true,p5(X1,X3),true),true) = true,
p5_15 ).
cnf(c_0_33,negated_conjecture,
p6(c7,f3(f3(c7))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_17]) ).
cnf(c_0_34,negated_conjecture,
ifeq2(p6(f4(X1),X2),true,p5(X1,X2),true) = true,
p5_8 ).
cnf(c_0_35,negated_conjecture,
p6(f4(f3(f3(c7))),f3(f4(c8))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_17]) ).
cnf(c_0_36,negated_conjecture,
ifeq2(p5(f3(f3(c7)),X1),true,p5(c7,X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_17]) ).
cnf(c_0_37,negated_conjecture,
p5(f3(f3(c7)),f3(f4(c8))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_17]) ).
cnf(c_0_38,negated_conjecture,
p5(c7,f3(f4(c8))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_17]) ).
cnf(c_0_39,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_40,negated_conjecture,
ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b,
not_p6_5 ).
cnf(c_0_41,negated_conjecture,
p6(f4(c7),f3(f4(c8))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_38]),c_0_17]) ).
cnf(c_0_42,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_43,negated_conjecture,
a != b,
c_0_39 ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN563-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n026.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 11:11:23 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 2.08/0.74 % Version: 3.5.1
% 2.08/0.74 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.08/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.74 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.08/0.74 % Starting new_bool_3 with 300s (1) cores
% 2.08/0.74 % Starting new_bool_1 with 300s (1) cores
% 2.08/0.74 % Starting sh5l with 300s (1) cores
% 2.08/0.74 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2116179 completed with status 0
% 2.08/0.74 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.08/0.74 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.08/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.74 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.08/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.08/0.74 % No SInE strategy applied
% 2.08/0.74 % Search class: FUUPM-FFMS32-MFFFFFNN
% 2.08/0.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.08/0.74 % Starting SubtermCWHack with 136s (1) cores
% 2.08/0.74 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.08/0.74 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 169s (1) cores
% 2.08/0.74 % Starting new_bool_3 with 169s (1) cores
% 2.08/0.74 % Starting new_bool_1 with 169s (1) cores
% 2.08/0.74 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 2116185 completed with status 0
% 2.08/0.74 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 2.08/0.74 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.08/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.74 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.08/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.08/0.74 % No SInE strategy applied
% 2.08/0.74 % Search class: FUUPM-FFMS32-MFFFFFNN
% 2.08/0.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.08/0.74 % Starting SubtermCWHack with 136s (1) cores
% 2.08/0.74 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.08/0.74 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 169s (1) cores
% 2.08/0.74 % Preprocessing time : 0.052 s
% 2.08/0.74
% 2.08/0.74 % Proof found!
% 2.08/0.74 % SZS status Unsatisfiable
% 2.08/0.74 % SZS output start CNFRefutation
% See solution above
% 2.08/0.74 % Parsed axioms : 20
% 2.08/0.74 % Removed by relevancy pruning/SinE : 0
% 2.08/0.74 % Initial clauses : 20
% 2.08/0.74 % Removed in clause preprocessing : 0
% 2.08/0.74 % Initial clauses in saturation : 20
% 2.08/0.74 % Processed clauses : 633
% 2.08/0.74 % ...of these trivial : 167
% 2.08/0.74 % ...subsumed : 0
% 2.08/0.74 % ...remaining for further processing : 466
% 2.08/0.74 % Other redundant clauses eliminated : 0
% 2.08/0.74 % Clauses deleted for lack of memory : 0
% 2.08/0.74 % Backward-subsumed : 0
% 2.08/0.74 % Backward-rewritten : 5
% 2.08/0.74 % Generated clauses : 16807
% 2.08/0.74 % ...of the previous two non-redundant : 14868
% 2.08/0.74 % ...aggressively subsumed : 0
% 2.08/0.74 % Contextual simplify-reflections : 0
% 2.08/0.74 % Paramodulations : 16807
% 2.08/0.74 % Factorizations : 0
% 2.08/0.74 % NegExts : 0
% 2.08/0.74 % Equation resolutions : 0
% 2.08/0.74 % Disequality decompositions : 0
% 2.08/0.74 % Total rewrite steps : 16458
% 2.08/0.74 % ...of those cached : 13559
% 2.08/0.74 % Propositional unsat checks : 0
% 2.08/0.74 % Propositional check models : 0
% 2.08/0.74 % Propositional check unsatisfiable : 0
% 2.08/0.74 % Propositional clauses : 0
% 2.08/0.74 % Propositional clauses after purity: 0
% 2.08/0.74 % Propositional unsat core size : 0
% 2.08/0.74 % Propositional preprocessing time : 0.000
% 2.08/0.74 % Propositional encoding time : 0.000
% 2.08/0.74 % Propositional solver time : 0.000
% 2.08/0.74 % Success case prop preproc time : 0.000
% 2.08/0.74 % Success case prop encoding time : 0.000
% 2.08/0.74 % Success case prop solver time : 0.000
% 2.08/0.74 % Current number of processed clauses : 461
% 2.08/0.74 % Positive orientable unit clauses : 460
% 2.08/0.74 % Positive unorientable unit clauses: 0
% 2.08/0.74 % Negative unit clauses : 1
% 2.08/0.74 % Non-unit-clauses : 0
% 2.08/0.74 % Current number of unprocessed clauses: 14254
% 2.08/0.74 % ...number of literals in the above : 14254
% 2.08/0.74 % Current number of archived formulas : 0
% 2.08/0.74 % Current number of archived clauses : 5
% 2.08/0.74 % Clause-clause subsumption calls (NU) : 0
% 2.08/0.74 % Rec. Clause-clause subsumption calls : 0
% 2.08/0.74 % Non-unit clause-clause subsumptions : 0
% 2.08/0.74 % Unit Clause-clause subsumption calls : 0
% 2.08/0.74 % Rewrite failures with RHS unbound : 0
% 2.08/0.74 % BW rewrite match attempts : 4350
% 2.08/0.74 % BW rewrite match successes : 5
% 2.08/0.74 % Condensation attempts : 0
% 2.08/0.74 % Condensation successes : 0
% 2.08/0.74 % Termbank termtop insertions : 312161
% 2.08/0.74 % Search garbage collected termcells : 2
% 2.08/0.74
% 2.08/0.74 % -------------------------------------------------
% 2.08/0.74 % User time : 0.260 s
% 2.08/0.74 % System time : 0.028 s
% 2.08/0.74 % Total time : 0.288 s
% 2.08/0.74 % Maximum resident set size: 3644 pages
% 2.08/0.74
% 2.08/0.74 % -------------------------------------------------
% 2.08/0.74 % User time : 1.181 s
% 2.08/0.74 % System time : 0.135 s
% 2.08/0.74 % Total time : 1.316 s
% 2.08/0.74 % Maximum resident set size: 4864 pages
% 2.08/0.74 % E exiting
%------------------------------------------------------------------------------