%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV433^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 : Wed Sep 30 08:35:31 AM UTC 2026
% Result : Theorem 0.08s 0.24s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 27 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 68 ( 16 ~; 25 |; 3 &; 22 @)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 0 ^; 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
f: $i > $o ).
thf(decl_24,type,
esk1_0: $i ).
thf(decl_25,type,
esk2_0: $i ).
thf(decl_26,type,
esk3_0: $i ).
thf(less3,conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( X1 = X2 )
| ( X1 = X3 )
| ( X2 = X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.Zc8dWeU3v0/E---3.1_3325324.p',less3) ).
thf(finj,axiom,
! [X1: $i,X2: $i] :
( ( ( f @ X1 )
<=> ( f @ X2 ) )
=> ( X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.Zc8dWeU3v0/E---3.1_3325324.p',finj) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: $i,X2: $i,X3: $i] :
( ( X1 = X2 )
| ( X1 = X3 )
| ( X2 = X3 ) ),
inference(assume_negation,[status(cth)],[less3]) ).
thf(c_0_3,plain,
! [X9: $i,X10: $i] :
( ( ~ ( f @ X9 )
| ~ ( f @ X10 )
| ( X9 = X10 ) )
& ( ( f @ X9 )
| ( f @ X10 )
| ( X9 = X10 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finj])])])]) ).
thf(c_0_4,negated_conjecture,
( ( esk1_0 != esk2_0 )
& ( esk1_0 != esk3_0 )
& ( esk2_0 != esk3_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
thf(c_0_5,plain,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ( f @ X1 )
| ~ ( f @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,plain,
! [X1: $i,X2: $i] :
( ( f @ X1 )
| ( f @ X2 )
| ( X1 = X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X1: $i,X2: $i,X3: $i] :
( ( X1 = X2 )
| ( X1 = X3 )
| ( f @ X2 )
| ~ ( f @ X3 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
esk1_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i] :
( ( esk2_0 = X1 )
| ( f @ esk1_0 )
| ~ ( f @ X1 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8])]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i] :
( ( esk1_0 = X1 )
| ( f @ esk3_0 )
| ~ ( f @ X1 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_8])]) ).
thf(c_0_12,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( esk1_0 = X1 )
| ( f @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_6]) ).
thf(c_0_14,negated_conjecture,
f @ esk1_0,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13])]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] :
( ( esk2_0 = X1 )
| ( f @ X1 )
| ~ ( f @ esk1_0 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8])]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] :
( ( esk1_0 = X1 )
| ~ ( f @ X1 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
( ( esk2_0 = X1 )
| ( f @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14])]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i] :
( ( esk2_0 = X1 )
| ( esk1_0 = X1 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_18]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV433^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n008.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 15:47:39 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.22 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.Zc8dWeU3v0/E---3.1_3325324.p
% 0.08/0.24 % Version: 3.5.1-ho
% 0.08/0.24 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.24 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.24 % Starting sh4l with 300s (1) cores
% 0.08/0.24 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.08/0.24 % new_ho_10 with pid 3325351 completed with status 0
% 0.08/0.24 % Result found by new_ho_10
% 0.08/0.24 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.24 % No SInE strategy applied
% 0.08/0.24 % Search class: HGUSF-FFSF00-SFFFFFNN
% 0.08/0.24 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.24 % Starting SubtermCWHack with 151s (1) cores
% 0.08/0.24 % Starting new_ho_10 with 901s (1) cores
% 0.08/0.24 % Starting ehoh_best8_lambda with 151s (1) cores
% 0.08/0.24 % Starting ho_unfolding_6 with 151s (1) cores
% 0.08/0.24 % Starting sh4l with 146s (1) cores
% 0.08/0.24 % ehoh_best8_lambda with pid 3325358 completed with status 0
% 0.08/0.24 % Result found by ehoh_best8_lambda
% 0.08/0.24 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.24 % No SInE strategy applied
% 0.08/0.24 % Search class: HGUSF-FFSF00-SFFFFFNN
% 0.08/0.24 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.24 % Starting SubtermCWHack with 151s (1) cores
% 0.08/0.24 % Starting new_ho_10 with 901s (1) cores
% 0.08/0.24 % Starting ehoh_best8_lambda with 151s (1) cores
% 0.08/0.24 % Preprocessing time : 0.001 s
% 0.08/0.24 % Presaturation interreduction done
% 0.08/0.24
% 0.08/0.24 % Proof found!
% 0.08/0.24 % SZS status Theorem
% 0.08/0.24 % SZS output start CNFRefutation
% See solution above
% 0.08/0.24 % Parsed axioms : 3
% 0.08/0.24 % Removed by relevancy pruning/SinE : 0
% 0.08/0.24 % Initial clauses : 6
% 0.08/0.24 % Removed in clause preprocessing : 1
% 0.08/0.24 % Initial clauses in saturation : 5
% 0.08/0.24 % Processed clauses : 29
% 0.08/0.24 % ...of these trivial : 0
% 0.08/0.24 % ...subsumed : 7
% 0.08/0.24 % ...remaining for further processing : 22
% 0.08/0.24 % Other redundant clauses eliminated : 9
% 0.08/0.24 % Clauses deleted for lack of memory : 0
% 0.08/0.24 % Backward-subsumed : 4
% 0.08/0.24 % Backward-rewritten : 1
% 0.08/0.24 % Generated clauses : 121
% 0.08/0.24 % ...of the previous two non-redundant : 94
% 0.08/0.24 % ...aggressively subsumed : 0
% 0.08/0.24 % Contextual simplify-reflections : 1
% 0.08/0.24 % Paramodulations : 102
% 0.08/0.24 % Factorizations : 10
% 0.08/0.24 % NegExts : 0
% 0.08/0.24 % Equation resolutions : 9
% 0.08/0.24 % Disequality decompositions : 0
% 0.08/0.24 % Total rewrite steps : 3
% 0.08/0.24 % ...of those cached : 2
% 0.08/0.24 % Propositional unsat checks : 0
% 0.08/0.24 % Propositional check models : 0
% 0.08/0.24 % Propositional check unsatisfiable : 0
% 0.08/0.24 % Propositional clauses : 0
% 0.08/0.24 % Propositional clauses after purity: 0
% 0.08/0.24 % Propositional unsat core size : 0
% 0.08/0.24 % Propositional preprocessing time : 0.000
% 0.08/0.24 % Propositional encoding time : 0.000
% 0.08/0.24 % Propositional solver time : 0.000
% 0.08/0.24 % Success case prop preproc time : 0.000
% 0.08/0.24 % Success case prop encoding time : 0.000
% 0.08/0.24 % Success case prop solver time : 0.000
% 0.08/0.24 % Current number of processed clauses : 12
% 0.08/0.24 % Positive orientable unit clauses : 1
% 0.08/0.24 % Positive unorientable unit clauses: 0
% 0.08/0.24 % Negative unit clauses : 3
% 0.08/0.24 % Non-unit-clauses : 8
% 0.08/0.24 % Current number of unprocessed clauses: 73
% 0.08/0.24 % ...number of literals in the above : 313
% 0.08/0.24 % Current number of archived formulas : 0
% 0.08/0.24 % Current number of archived clauses : 10
% 0.08/0.24 % Clause-clause subsumption calls (NU) : 26
% 0.08/0.24 % Rec. Clause-clause subsumption calls : 26
% 0.08/0.24 % Non-unit clause-clause subsumptions : 10
% 0.08/0.24 % Unit Clause-clause subsumption calls : 4
% 0.08/0.24 % Rewrite failures with RHS unbound : 0
% 0.08/0.24 % BW rewrite match attempts : 1
% 0.08/0.24 % BW rewrite match successes : 1
% 0.08/0.24 % Condensation attempts : 0
% 0.08/0.24 % Condensation successes : 0
% 0.08/0.24 % Termbank termtop insertions : 2820
% 0.08/0.24 % Search garbage collected termcells : 91
% 0.08/0.24
% 0.08/0.24 % -------------------------------------------------
% 0.08/0.24 % User time : 0.004 s
% 0.08/0.24 % System time : 0.001 s
% 0.08/0.24 % Total time : 0.005 s
% 0.08/0.24 % Maximum resident set size: 3624 pages
% 0.08/0.24
% 0.08/0.24 % -------------------------------------------------
% 0.08/0.24 % User time : 0.016 s
% 0.08/0.24 % System time : 0.008 s
% 0.08/0.24 % Total time : 0.024 s
% 0.08/0.24 % Maximum resident set size: 4608 pages
% 0.08/0.24 % E exiting
%------------------------------------------------------------------------------