%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG069+1 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 : Theorem 0.16s 0.64s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 3 unt; 0 def)
% Number of atoms : 77 ( 22 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 88 ( 30 ~; 21 |; 17 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 28 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
( ( ! [X2] :
( sorti2(X2)
=> sorti1(j(X2)) )
& ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) ) )
=> ~ ( ! [X8] :
( sorti1(X8)
=> j(h(X8)) = X8 )
& ! [X7] :
( sorti2(X7)
=> h(j(X7)) = X7 )
& ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax4,axiom,
~ ! [X1] :
( sorti2(X1)
=> ? [X2] :
( op2(X2,X2) = X1
& sorti2(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(ax3,axiom,
! [X1] :
( sorti1(X1)
=> ? [X2] :
( op1(X2,X2) = X1
& sorti1(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
fof(c_0_3,negated_conjecture,
~ ( ( ! [X2] :
( sorti2(X2)
=> sorti1(j(X2)) )
& ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) ) )
=> ~ ( ! [X8] :
( sorti1(X8)
=> j(h(X8)) = X8 )
& ! [X7] :
( sorti2(X7)
=> h(j(X7)) = X7 )
& ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,plain,
! [X16] :
( ( op2(X16,X16) != esk2_0
| ~ sorti2(X16) )
& sorti2(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( j(h(X24)) = X24
| ~ sorti1(X24) )
& ( h(j(X23)) = X23
| ~ sorti2(X23) )
& ( j(op2(X21,X22)) = op1(j(X21),j(X22))
| ~ sorti2(X22)
| ~ sorti2(X21) )
& ( h(op1(X19,X20)) = op2(h(X19),h(X20))
| ~ sorti1(X20)
| ~ sorti1(X19) )
& ( sorti1(j(X18))
| ~ sorti2(X18) )
& ( sorti2(h(X17))
| ~ sorti1(X17) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( op2(X1,X1) != esk2_0
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ sorti1(X2)
| ~ sorti1(X1)
| h(op1(X1,X2)) = op2(h(X1),h(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( ~ sorti1(X1)
| sorti2(h(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X13] :
( ( ~ sorti1(X13)
| op1(esk1_1(X13),esk1_1(X13)) = X13 )
& ( ~ sorti1(X13)
| sorti1(esk1_1(X13)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ sorti1(X1)
| h(op1(X1,X1)) != esk2_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,plain,
( ~ sorti1(X1)
| op1(esk1_1(X1),esk1_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ sorti1(X1)
| sorti1(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( ~ sorti1(X1)
| h(X1) != esk2_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( ~ sorti2(X1)
| h(j(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
sorti2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
~ sorti1(j(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14])]),c_0_15])]) ).
cnf(c_0_17,negated_conjecture,
( ~ sorti2(X1)
| sorti1(j(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG069+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.57 % Computer : n018.cluster.edu
% 0.11/0.57 % Model : x86_64 x86_64
% 0.11/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.57 % Memory : 8046.5625MB
% 0.11/0.57 % OS : Linux 6.8.0-71-generic
% 0.11/0.57 % CPULimit : 300
% 0.11/0.57 % WCLimit : 300
% 0.11/0.57 % DateTime : Mon Sep 21 12:57:15 UTC 2026
% 0.11/0.57 % CPUTime :
% 0.11/0.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.62 Running first-order theorem proving
% 0.11/0.62 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.16/0.64 % Version: 3.5.1
% 0.16/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.64 % Starting sh5l with 300s (1) cores
% 0.16/0.64 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1933803 completed with status 0
% 0.16/0.64 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.64 % No SInE strategy applied
% 0.16/0.64 % Search class: FHHSF-FFSF21-SFFFFFNN
% 0.16/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.64 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.64 % Starting new_bool_1 with 136s (1) cores
% 0.16/0.64 % new_bool_1 with pid 1933811 completed with status 0
% 0.16/0.64 % Result found by new_bool_1
% 0.16/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.64 % No SInE strategy applied
% 0.16/0.64 % Search class: FHHSF-FFSF21-SFFFFFNN
% 0.16/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.64 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.64 % Starting new_bool_1 with 136s (1) cores
% 0.16/0.64 % Preprocessing time : 0.001 s
% 0.16/0.64 % Presaturation interreduction done
% 0.16/0.64
% 0.16/0.64 % Proof found!
% 0.16/0.64 % SZS status Theorem
% 0.16/0.64 % SZS output start CNFRefutation
% See solution above
% 0.16/0.64 % Parsed axioms : 5
% 0.16/0.64 % Removed by relevancy pruning/SinE : 0
% 0.16/0.64 % Initial clauses : 12
% 0.16/0.64 % Removed in clause preprocessing : 0
% 0.16/0.64 % Initial clauses in saturation : 12
% 0.16/0.64 % Processed clauses : 26
% 0.16/0.64 % ...of these trivial : 0
% 0.16/0.64 % ...subsumed : 0
% 0.16/0.64 % ...remaining for further processing : 26
% 0.16/0.64 % Other redundant clauses eliminated : 1
% 0.16/0.64 % Clauses deleted for lack of memory : 0
% 0.16/0.64 % Backward-subsumed : 0
% 0.16/0.64 % Backward-rewritten : 0
% 0.16/0.64 % Generated clauses : 11
% 0.16/0.64 % ...of the previous two non-redundant : 6
% 0.16/0.64 % ...aggressively subsumed : 0
% 0.16/0.64 % Contextual simplify-reflections : 2
% 0.16/0.64 % Paramodulations : 10
% 0.16/0.64 % Factorizations : 0
% 0.16/0.64 % NegExts : 0
% 0.16/0.64 % Equation resolutions : 1
% 0.16/0.64 % Disequality decompositions : 0
% 0.16/0.64 % Total rewrite steps : 2
% 0.16/0.64 % ...of those cached : 1
% 0.16/0.64 % Propositional unsat checks : 0
% 0.16/0.64 % Propositional check models : 0
% 0.16/0.64 % Propositional check unsatisfiable : 0
% 0.16/0.64 % Propositional clauses : 0
% 0.16/0.64 % Propositional clauses after purity: 0
% 0.16/0.64 % Propositional unsat core size : 0
% 0.16/0.64 % Propositional preprocessing time : 0.000
% 0.16/0.64 % Propositional encoding time : 0.000
% 0.16/0.64 % Propositional solver time : 0.000
% 0.16/0.64 % Success case prop preproc time : 0.000
% 0.16/0.64 % Success case prop encoding time : 0.000
% 0.16/0.64 % Success case prop solver time : 0.000
% 0.16/0.64 % Current number of processed clauses : 14
% 0.16/0.64 % Positive orientable unit clauses : 1
% 0.16/0.64 % Positive unorientable unit clauses: 0
% 0.16/0.64 % Negative unit clauses : 1
% 0.16/0.64 % Non-unit-clauses : 12
% 0.16/0.64 % Current number of unprocessed clauses: 4
% 0.16/0.64 % ...number of literals in the above : 16
% 0.16/0.64 % Current number of archived formulas : 0
% 0.16/0.64 % Current number of archived clauses : 12
% 0.16/0.64 % Clause-clause subsumption calls (NU) : 5
% 0.16/0.64 % Rec. Clause-clause subsumption calls : 4
% 0.16/0.64 % Non-unit clause-clause subsumptions : 2
% 0.16/0.64 % Unit Clause-clause subsumption calls : 2
% 0.16/0.64 % Rewrite failures with RHS unbound : 0
% 0.16/0.64 % BW rewrite match attempts : 0
% 0.16/0.64 % BW rewrite match successes : 0
% 0.16/0.64 % Condensation attempts : 0
% 0.16/0.64 % Condensation successes : 0
% 0.16/0.64 % Termbank termtop insertions : 1306
% 0.16/0.64 % Search garbage collected termcells : 331
% 0.16/0.64
% 0.16/0.64 % -------------------------------------------------
% 0.16/0.64 % User time : 0.003 s
% 0.16/0.64 % System time : 0.002 s
% 0.16/0.64 % Total time : 0.005 s
% 0.16/0.64 % Maximum resident set size: 3640 pages
% 0.16/0.64
% 0.16/0.64 % -------------------------------------------------
% 0.16/0.64 % User time : 0.012 s
% 0.16/0.64 % System time : 0.011 s
% 0.16/0.64 % Total time : 0.023 s
% 0.16/0.64 % Maximum resident set size: 4608 pages
% 0.16/0.64 % E exiting
%------------------------------------------------------------------------------