%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ALG178+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 : n017.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:25 PM UTC 2026
% Result : Theorem 0.23s 0.61s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 4 unt; 0 def)
% Number of atoms : 105 ( 27 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 121 ( 44 ~; 38 |; 15 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 5 ( 2 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 : 60 ( 0 sgn 34 !; 0 ?)
% 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(ax1,axiom,
! [X1] :
( sorti1(X1)
=> ! [X2] :
( sorti1(X2)
=> sorti1(op1(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
fof(ax3,axiom,
! [X1] :
( sorti1(X1)
=> ! [X2] :
( sorti1(X2)
=> op1(X1,op1(X1,X2)) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
fof(ax4,axiom,
~ ! [X1] :
( sorti2(X1)
=> ! [X2] :
( sorti2(X2)
=> op2(X1,op2(X1,X2)) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
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,
! [X9,X10] :
( sorti1(op1(X9,X10))
| ~ sorti1(X10)
| ~ sorti1(X9) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])])])]) ).
fof(c_0_6,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_4])])])]) ).
cnf(c_0_7,plain,
( ~ sorti1(X2)
| ~ sorti1(X1)
| sorti1(op1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,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_9,negated_conjecture,
( ~ sorti2(X1)
| sorti1(j(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ sorti1(X1)
| j(h(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( ~ sorti1(X1)
| sorti2(h(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ sorti1(X2)
| ~ sorti1(X1)
| h(op1(X1,X2)) = op2(h(X1),h(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( ~ sorti2(X1)
| h(j(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,plain,
! [X13,X14] :
( op1(X13,op1(X13,X14)) = X14
| ~ sorti1(X14)
| ~ sorti1(X13) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])]) ).
cnf(c_0_15,negated_conjecture,
( ~ sorti2(X1)
| ~ sorti2(X2)
| sorti1(j(op2(X1,X2))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( ~ sorti1(X2)
| ~ sorti2(X1)
| j(op2(X1,h(X2))) = op1(j(X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_10]),c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( ~ sorti1(X2)
| ~ sorti2(X1)
| h(op1(j(X1),X2)) = op2(X1,h(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_9]) ).
cnf(c_0_18,plain,
( ~ sorti1(X2)
| ~ sorti1(X1)
| op1(X1,op1(X1,X2)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( ~ sorti1(X2)
| ~ sorti2(X1)
| sorti1(op1(j(X1),X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( ~ sorti1(X2)
| ~ sorti2(X1)
| op2(X1,h(op1(j(X1),X2))) = h(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9]),c_0_19]) ).
fof(c_0_21,plain,
( op2(esk1_0,op2(esk1_0,esk2_0)) != esk2_0
& sorti2(esk2_0)
& sorti2(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ sorti1(X2)
| ~ sorti2(X1)
| op2(X1,op2(X1,h(X2))) = h(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_23,plain,
op2(esk1_0,op2(esk1_0,esk2_0)) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( ~ sorti2(X2)
| ~ sorti2(X1)
| op2(X1,op2(X1,X2)) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_9]) ).
cnf(c_0_25,plain,
sorti2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
sorti2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : ALG178+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n017.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 12:55:42 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 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.23/0.61 % Version: 3.5.1
% 0.23/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.61 % Starting sh5l with 300s (1) cores
% 0.23/0.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2366671 completed with status 0
% 0.23/0.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.61 % No SInE strategy applied
% 0.23/0.61 % Search class: FHUSF-FFSF21-SFFFFFNN
% 0.23/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/0.61 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.61 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.61 % new_bool_1 with pid 2366679 completed with status 0
% 0.23/0.61 % Result found by new_bool_1
% 0.23/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.61 % No SInE strategy applied
% 0.23/0.61 % Search class: FHUSF-FFSF21-SFFFFFNN
% 0.23/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/0.61 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.61 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.61 % Preprocessing time : 0.002 s
% 0.23/0.61 % Presaturation interreduction done
% 0.23/0.61
% 0.23/0.61 % Proof found!
% 0.23/0.61 % SZS status Theorem
% 0.23/0.61 % SZS output start CNFRefutation
% See solution above
% 0.23/0.61 % Parsed axioms : 5
% 0.23/0.61 % Removed by relevancy pruning/SinE : 0
% 0.23/0.61 % Initial clauses : 12
% 0.23/0.61 % Removed in clause preprocessing : 0
% 0.23/0.61 % Initial clauses in saturation : 12
% 0.23/0.61 % Processed clauses : 184
% 0.23/0.61 % ...of these trivial : 0
% 0.23/0.61 % ...subsumed : 118
% 0.23/0.61 % ...remaining for further processing : 66
% 0.23/0.61 % Other redundant clauses eliminated : 0
% 0.23/0.61 % Clauses deleted for lack of memory : 0
% 0.23/0.61 % Backward-subsumed : 1
% 0.23/0.61 % Backward-rewritten : 0
% 0.23/0.61 % Generated clauses : 521
% 0.23/0.61 % ...of the previous two non-redundant : 476
% 0.23/0.61 % ...aggressively subsumed : 0
% 0.23/0.61 % Contextual simplify-reflections : 38
% 0.23/0.61 % Paramodulations : 521
% 0.23/0.61 % Factorizations : 0
% 0.23/0.61 % NegExts : 0
% 0.23/0.61 % Equation resolutions : 0
% 0.23/0.61 % Disequality decompositions : 0
% 0.23/0.61 % Total rewrite steps : 2
% 0.23/0.61 % ...of those cached : 0
% 0.23/0.61 % Propositional unsat checks : 0
% 0.23/0.61 % Propositional check models : 0
% 0.23/0.61 % Propositional check unsatisfiable : 0
% 0.23/0.61 % Propositional clauses : 0
% 0.23/0.61 % Propositional clauses after purity: 0
% 0.23/0.61 % Propositional unsat core size : 0
% 0.23/0.61 % Propositional preprocessing time : 0.000
% 0.23/0.61 % Propositional encoding time : 0.000
% 0.23/0.61 % Propositional solver time : 0.000
% 0.23/0.61 % Success case prop preproc time : 0.000
% 0.23/0.61 % Success case prop encoding time : 0.000
% 0.23/0.61 % Success case prop solver time : 0.000
% 0.23/0.61 % Current number of processed clauses : 53
% 0.23/0.61 % Positive orientable unit clauses : 2
% 0.23/0.61 % Positive unorientable unit clauses: 0
% 0.23/0.61 % Negative unit clauses : 1
% 0.23/0.61 % Non-unit-clauses : 50
% 0.23/0.61 % Current number of unprocessed clauses: 316
% 0.23/0.61 % ...number of literals in the above : 1560
% 0.23/0.61 % Current number of archived formulas : 0
% 0.23/0.61 % Current number of archived clauses : 13
% 0.23/0.61 % Clause-clause subsumption calls (NU) : 1073
% 0.23/0.61 % Rec. Clause-clause subsumption calls : 540
% 0.23/0.61 % Non-unit clause-clause subsumptions : 157
% 0.23/0.61 % Unit Clause-clause subsumption calls : 0
% 0.23/0.61 % Rewrite failures with RHS unbound : 0
% 0.23/0.61 % BW rewrite match attempts : 0
% 0.23/0.61 % BW rewrite match successes : 0
% 0.23/0.61 % Condensation attempts : 0
% 0.23/0.61 % Condensation successes : 0
% 0.23/0.61 % Termbank termtop insertions : 9219
% 0.23/0.61 % Search garbage collected termcells : 335
% 0.23/0.61
% 0.23/0.61 % -------------------------------------------------
% 0.23/0.61 % User time : 0.022 s
% 0.23/0.61 % System time : 0.007 s
% 0.23/0.61 % Total time : 0.030 s
% 0.23/0.61 % Maximum resident set size: 3640 pages
% 0.23/0.61
% 0.23/0.61 % -------------------------------------------------
% 0.23/0.61 % User time : 0.084 s
% 0.23/0.61 % System time : 0.024 s
% 0.23/0.61 % Total time : 0.108 s
% 0.23/0.61 % Maximum resident set size: 4864 pages
% 0.23/0.61 % E exiting
%------------------------------------------------------------------------------