%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG069-10 : TPTP v9.3.1. Released v7.3.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 11:51:26 AM UTC 2026
% Result : Unsatisfiable 0.22s 0.56s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 13 RR)
% Number of literals : 29 ( 28 equ; 4 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; 2 con; 0-4 aty)
% Number of variables : 29 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_3,negated_conjecture,
ifeq(sorti2(X1),true,sorti1(j(X1)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
cnf(ax4,axiom,
sorti2(sK1_ax4_U) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(ax3_1,axiom,
ifeq(sorti1(X1),true,sorti1(sK2_ax3_V(X1)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3_1) ).
cnf(ax4_1,axiom,
tuple(op2(X1,X1),sorti2(X1)) != tuple(sK1_ax4_U,true),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4_1) ).
cnf(co1,negated_conjecture,
ifeq(sorti1(X1),true,sorti2(h(X1)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(ax3,axiom,
ifeq2(sorti1(X1),true,op1(sK2_ax3_V(X1),sK2_ax3_V(X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(co1_5,negated_conjecture,
ifeq2(sorti2(X1),true,h(j(X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_1,negated_conjecture,
ifeq2(sorti1(X1),true,ifeq2(sorti1(X2),true,op2(h(X2),h(X1)),h(op1(X2,X1))),h(op1(X2,X1))) = h(op1(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(c_0_10,negated_conjecture,
ifeq(sorti2(X1),true,sorti1(j(X1)),true) = true,
co1_3 ).
cnf(c_0_11,axiom,
sorti2(sK1_ax4_U) = true,
ax4 ).
cnf(c_0_12,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_13,axiom,
ifeq(sorti1(X1),true,sorti1(sK2_ax3_V(X1)),true) = true,
ax3_1 ).
cnf(c_0_14,negated_conjecture,
sorti1(j(sK1_ax4_U)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,plain,
tuple(op2(X1,X1),sorti2(X1)) != tuple(sK1_ax4_U,true),
inference(fof_simplification,[status(thm)],[ax4_1]) ).
cnf(c_0_16,negated_conjecture,
ifeq(sorti1(X1),true,sorti2(h(X1)),true) = true,
co1 ).
cnf(c_0_17,negated_conjecture,
sorti1(sK2_ax3_V(j(sK1_ax4_U))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_18,axiom,
ifeq2(sorti1(X1),true,op1(sK2_ax3_V(X1),sK2_ax3_V(X1)),X1) = X1,
ax3 ).
cnf(c_0_19,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_20,negated_conjecture,
ifeq2(sorti2(X1),true,h(j(X1)),X1) = X1,
co1_5 ).
cnf(c_0_21,plain,
tuple(op2(X1,X1),sorti2(X1)) != tuple(sK1_ax4_U,true),
c_0_15 ).
cnf(c_0_22,negated_conjecture,
sorti2(h(sK2_ax3_V(j(sK1_ax4_U)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_12]) ).
cnf(c_0_23,negated_conjecture,
ifeq2(sorti1(X1),true,ifeq2(sorti1(X2),true,op2(h(X2),h(X1)),h(op1(X2,X1))),h(op1(X2,X1))) = h(op1(X2,X1)),
co1_1 ).
cnf(c_0_24,negated_conjecture,
op1(sK2_ax3_V(j(sK1_ax4_U)),sK2_ax3_V(j(sK1_ax4_U))) = j(sK1_ax4_U),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
h(j(sK1_ax4_U)) = sK1_ax4_U,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_11]),c_0_19]) ).
cnf(c_0_26,negated_conjecture,
tuple(op2(h(sK2_ax3_V(j(sK1_ax4_U))),h(sK2_ax3_V(j(sK1_ax4_U)))),true) != tuple(sK1_ax4_U,true),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
op2(h(sK2_ax3_V(j(sK1_ax4_U))),h(sK2_ax3_V(j(sK1_ax4_U)))) = sK1_ax4_U,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_17]),c_0_17]),c_0_25]),c_0_19]),c_0_25]),c_0_19]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : ALG069-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n026.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 12:57:39 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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.22/0.56 % Version: 3.5.1
% 0.22/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 % Starting sh5l with 300s (1) cores
% 0.22/0.56 % sh5l with pid 2311510 completed with status 0
% 0.22/0.56 % Result found by sh5l
% 0.22/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 % Starting sh5l with 300s (1) cores
% 0.22/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.56 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.56 % Search class: FUUPM-FFSF31-MFFFFFNN
% 0.22/0.56 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.56 % SubtermCWHack with pid 2311517 completed with status 0
% 0.22/0.56 % Result found by SubtermCWHack
% 0.22/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 % Starting sh5l with 300s (1) cores
% 0.22/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.56 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.56 % Search class: FUUPM-FFSF31-MFFFFFNN
% 0.22/0.56 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.56 % Preprocessing time : 0.002 s
% 0.22/0.56
% 0.22/0.56 % Proof found!
% 0.22/0.56 % SZS status Unsatisfiable
% 0.22/0.56 % SZS output start CNFRefutation
% See solution above
% 0.22/0.56 % Parsed axioms : 14
% 0.22/0.56 % Removed by relevancy pruning/SinE : 0
% 0.22/0.56 % Initial clauses : 14
% 0.22/0.56 % Removed in clause preprocessing : 0
% 0.22/0.56 % Initial clauses in saturation : 14
% 0.22/0.56 % Processed clauses : 114
% 0.22/0.56 % ...of these trivial : 7
% 0.22/0.56 % ...subsumed : 0
% 0.22/0.56 % ...remaining for further processing : 107
% 0.22/0.56 % Other redundant clauses eliminated : 0
% 0.22/0.56 % Clauses deleted for lack of memory : 0
% 0.22/0.56 % Backward-subsumed : 0
% 0.22/0.56 % Backward-rewritten : 7
% 0.22/0.56 % Generated clauses : 842
% 0.22/0.56 % ...of the previous two non-redundant : 708
% 0.22/0.56 % ...aggressively subsumed : 0
% 0.22/0.56 % Contextual simplify-reflections : 0
% 0.22/0.56 % Paramodulations : 842
% 0.22/0.56 % Factorizations : 0
% 0.22/0.56 % NegExts : 0
% 0.22/0.56 % Equation resolutions : 0
% 0.22/0.56 % Disequality decompositions : 0
% 0.22/0.56 % Total rewrite steps : 1051
% 0.22/0.56 % ...of those cached : 335
% 0.22/0.56 % Propositional unsat checks : 0
% 0.22/0.56 % Propositional check models : 0
% 0.22/0.56 % Propositional check unsatisfiable : 0
% 0.22/0.56 % Propositional clauses : 0
% 0.22/0.56 % Propositional clauses after purity: 0
% 0.22/0.56 % Propositional unsat core size : 0
% 0.22/0.56 % Propositional preprocessing time : 0.000
% 0.22/0.56 % Propositional encoding time : 0.000
% 0.22/0.56 % Propositional solver time : 0.000
% 0.22/0.56 % Success case prop preproc time : 0.000
% 0.22/0.56 % Success case prop encoding time : 0.000
% 0.22/0.56 % Success case prop solver time : 0.000
% 0.22/0.56 % Current number of processed clauses : 100
% 0.22/0.56 % Positive orientable unit clauses : 97
% 0.22/0.56 % Positive unorientable unit clauses: 0
% 0.22/0.56 % Negative unit clauses : 3
% 0.22/0.56 % Non-unit-clauses : 0
% 0.22/0.56 % Current number of unprocessed clauses: 603
% 0.22/0.56 % ...number of literals in the above : 603
% 0.22/0.56 % Current number of archived formulas : 0
% 0.22/0.56 % Current number of archived clauses : 7
% 0.22/0.56 % Clause-clause subsumption calls (NU) : 0
% 0.22/0.56 % Rec. Clause-clause subsumption calls : 0
% 0.22/0.56 % Non-unit clause-clause subsumptions : 0
% 0.22/0.56 % Unit Clause-clause subsumption calls : 3
% 0.22/0.56 % Rewrite failures with RHS unbound : 0
% 0.22/0.56 % BW rewrite match attempts : 266
% 0.22/0.56 % BW rewrite match successes : 6
% 0.22/0.56 % Condensation attempts : 0
% 0.22/0.56 % Condensation successes : 0
% 0.22/0.56 % Termbank termtop insertions : 19751
% 0.22/0.56 % Search garbage collected termcells : 2
% 0.22/0.56
% 0.22/0.56 % -------------------------------------------------
% 0.22/0.56 % User time : 0.021 s
% 0.22/0.56 % System time : 0.005 s
% 0.22/0.56 % Total time : 0.026 s
% 0.22/0.56 % Maximum resident set size: 3640 pages
% 0.22/0.56
% 0.22/0.56 % -------------------------------------------------
% 0.22/0.56 % User time : 0.024 s
% 0.22/0.56 % System time : 0.010 s
% 0.22/0.56 % Total time : 0.034 s
% 0.22/0.56 % Maximum resident set size: 4864 pages
% 0.22/0.56 % E exiting
%------------------------------------------------------------------------------