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