%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG203+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 : n002.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:55:33 AM UTC 2026
% Result : Theorem 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 105 ( 37 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 120 ( 42 ~; 30 |; 28 &)
% ( 0 <=>; 20 =>; 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 30 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax4,axiom,
~ ( ? [X2] :
( op2(X2,X2) != X2
& sorti2(X2) )
& ? [X1] :
( op2(X1,X1) = X1
& sorti2(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
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(ax3,axiom,
( ? [X2] :
( op1(X2,X2) != X2
& sorti1(X2) )
& ? [X1] :
( op1(X1,X1) = X1
& sorti1(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
fof(ax1,axiom,
! [X1] :
( sorti1(X1)
=> ! [X2] :
( sorti1(X2)
=> sorti1(op1(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
fof(c_0_4,plain,
~ ( ? [X2] :
( op2(X2,X2) != X2
& sorti2(X2) )
& ? [X1] :
( op2(X1,X1) = X1
& sorti2(X1) ) ),
inference(fof_simplification,[status(thm)],[ax4]) ).
fof(c_0_5,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_6,plain,
! [X23,X24] :
( op2(X24,X24) = X24
| ~ sorti2(X24)
| op2(X23,X23) != X23
| ~ sorti2(X23) ),
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,negated_conjecture,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( j(h(X16)) = X16
| ~ sorti1(X16) )
& ( h(j(X15)) = X15
| ~ sorti2(X15) )
& ( j(op2(X13,X14)) = op1(j(X13),j(X14))
| ~ sorti2(X14)
| ~ sorti2(X13) )
& ( h(op1(X11,X12)) = op2(h(X11),h(X12))
| ~ sorti1(X12)
| ~ sorti1(X11) )
& ( sorti1(j(X10))
| ~ sorti2(X10) )
& ( sorti2(h(X9))
| ~ sorti1(X9) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
( ? [X2] :
( op1(X2,X2) != X2
& sorti1(X2) )
& ? [X1] :
( op1(X1,X1) = X1
& sorti1(X1) ) ),
inference(fof_simplification,[status(thm)],[ax3]) ).
cnf(c_0_9,plain,
( ~ sorti2(X2)
| op2(X1,X1) != X1
| ~ sorti2(X1)
| op2(X2,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ sorti1(X2)
| ~ sorti1(X1)
| h(op1(X1,X2)) = op2(h(X1),h(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( ~ sorti1(X1)
| sorti2(h(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
( op1(esk2_0,esk2_0) != esk2_0
& sorti1(esk2_0)
& op1(esk1_0,esk1_0) = esk1_0
& sorti1(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ sorti1(X2)
| ~ sorti2(X1)
| h(op1(X2,X2)) != h(X2)
| op2(X1,X1) = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,plain,
op1(esk1_0,esk1_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
sorti1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ sorti2(X1)
| op2(X1,X1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_17,negated_conjecture,
( ~ sorti1(X1)
| j(h(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( ~ sorti1(X1)
| h(op1(X1,X1)) = h(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_11]) ).
fof(c_0_19,plain,
! [X17,X18] :
( sorti1(op1(X17,X18))
| ~ sorti1(X18)
| ~ sorti1(X17) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])])])]) ).
cnf(c_0_20,negated_conjecture,
( ~ sorti1(X1)
| ~ sorti1(op1(X1,X1))
| op1(X1,X1) = j(h(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( ~ sorti1(X2)
| ~ sorti1(X1)
| sorti1(op1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
op1(esk2_0,esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
( ~ sorti1(X1)
| op1(X1,X1) = j(h(X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
sorti1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
j(h(esk2_0)) != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG203+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.10/0.36 % Computer : n002.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % 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 13:04:18 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.43 % Version: 3.5.1
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % new_bool_1 with pid 3340083 completed with status 0
% 0.13/0.43 % Result found by new_bool_1
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43 % Search class: FHUSF-FFSS21-SFFFFFNN
% 0.13/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.43 % SubtermCWHack with pid 3340090 completed with status 0
% 0.13/0.43 % Result found by SubtermCWHack
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43 % Search class: FHUSF-FFSS21-SFFFFFNN
% 0.13/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.43 % Preprocessing time : 0.001 s
% 0.13/0.43
% 0.13/0.43 % Proof found!
% 0.13/0.43 % SZS status Theorem
% 0.13/0.43 % SZS output start CNFRefutation
% See solution above
% 0.13/0.44 % Parsed axioms : 5
% 0.13/0.44 % Removed by relevancy pruning/SinE : 0
% 0.13/0.44 % Initial clauses : 13
% 0.13/0.44 % Removed in clause preprocessing : 0
% 0.13/0.44 % Initial clauses in saturation : 13
% 0.13/0.44 % Processed clauses : 43
% 0.13/0.44 % ...of these trivial : 0
% 0.13/0.44 % ...subsumed : 10
% 0.13/0.44 % ...remaining for further processing : 33
% 0.13/0.44 % Other redundant clauses eliminated : 0
% 0.13/0.44 % Clauses deleted for lack of memory : 0
% 0.13/0.44 % Backward-subsumed : 3
% 0.13/0.44 % Backward-rewritten : 1
% 0.13/0.44 % Generated clauses : 97
% 0.13/0.44 % ...of the previous two non-redundant : 79
% 0.13/0.44 % ...aggressively subsumed : 0
% 0.13/0.44 % Contextual simplify-reflections : 15
% 0.13/0.44 % Paramodulations : 97
% 0.13/0.44 % Factorizations : 0
% 0.13/0.44 % NegExts : 0
% 0.13/0.44 % Equation resolutions : 0
% 0.13/0.44 % Disequality decompositions : 0
% 0.13/0.44 % Total rewrite steps : 24
% 0.13/0.44 % ...of those cached : 20
% 0.13/0.44 % Propositional unsat checks : 0
% 0.13/0.44 % Propositional check models : 0
% 0.13/0.44 % Propositional check unsatisfiable : 0
% 0.13/0.44 % Propositional clauses : 0
% 0.13/0.44 % Propositional clauses after purity: 0
% 0.13/0.44 % Propositional unsat core size : 0
% 0.13/0.44 % Propositional preprocessing time : 0.000
% 0.13/0.44 % Propositional encoding time : 0.000
% 0.13/0.44 % Propositional solver time : 0.000
% 0.13/0.44 % Success case prop preproc time : 0.000
% 0.13/0.44 % Success case prop encoding time : 0.000
% 0.13/0.44 % Success case prop solver time : 0.000
% 0.13/0.44 % Current number of processed clauses : 29
% 0.13/0.44 % Positive orientable unit clauses : 5
% 0.13/0.44 % Positive unorientable unit clauses: 0
% 0.13/0.44 % Negative unit clauses : 2
% 0.13/0.44 % Non-unit-clauses : 22
% 0.13/0.44 % Current number of unprocessed clauses: 49
% 0.13/0.44 % ...number of literals in the above : 189
% 0.13/0.44 % Current number of archived formulas : 0
% 0.13/0.44 % Current number of archived clauses : 4
% 0.13/0.44 % Clause-clause subsumption calls (NU) : 146
% 0.13/0.44 % Rec. Clause-clause subsumption calls : 113
% 0.13/0.44 % Non-unit clause-clause subsumptions : 28
% 0.13/0.44 % Unit Clause-clause subsumption calls : 1
% 0.13/0.44 % Rewrite failures with RHS unbound : 0
% 0.13/0.44 % BW rewrite match attempts : 2
% 0.13/0.44 % BW rewrite match successes : 1
% 0.13/0.44 % Condensation attempts : 0
% 0.13/0.44 % Condensation successes : 0
% 0.13/0.44 % Termbank termtop insertions : 2434
% 0.13/0.44 % Search garbage collected termcells : 338
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.006 s
% 0.13/0.44 % System time : 0.001 s
% 0.13/0.44 % Total time : 0.007 s
% 0.13/0.44 % Maximum resident set size: 3588 pages
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.006 s
% 0.13/0.44 % System time : 0.007 s
% 0.13/0.44 % Total time : 0.012 s
% 0.13/0.44 % Maximum resident set size: 4608 pages
% 0.13/0.44 % E exiting
%------------------------------------------------------------------------------