%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEV434^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 : 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 : Wed Sep 30 08:36:36 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 57 ( 40 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 54 ( 11 ~; 23 |; 3 &; 17 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 25 ( 0 ^; 24 !; 1 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
f: $o > $i ).
thf(decl_24,type,
epred1_1: $i > $o ).
thf(decl_25,type,
esk1_0: $i ).
thf(decl_26,type,
esk2_0: $i ).
thf(decl_27,type,
esk3_0: $i ).
thf(fsurj,axiom,
! [X1: $i] :
? [X2: $o] :
( ( f @ X2 )
= X1 ),
file('/export/starexec/sandbox/tmp/tmp.nqyM09K6KE/E---3.1_251954.p',fsurj) ).
thf(less3,conjecture,
! [X3: $i,X1: $i,X4: $i] :
( ( X3 = X1 )
| ( X3 = X4 )
| ( X1 = X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.nqyM09K6KE/E---3.1_251954.p',less3) ).
thf(c_0_2,plain,
! [X10: $i] :
( ( ~ ( epred1_1 @ X10 )
| ( ( f @ $true )
= X10 ) )
& ( ( epred1_1 @ X10 )
| ( ( f @ $false )
= X10 ) ) ),
inference(fool_unroll,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fsurj])])]) ).
thf(c_0_3,plain,
! [X1: $i] :
( ( ( f @ $true )
= X1 )
| ~ ( epred1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,plain,
! [X1: $i] :
( ( epred1_1 @ X1 )
| ( ( f @ ~ $true )
= X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,plain,
! [X1: $i] :
( ( ( f @ ~ $true )
= X1 )
| ( ( f @ $true )
= X1 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
~ ! [X3: $i,X1: $i,X4: $i] :
( ( X3 = X1 )
| ( X3 = X4 )
| ( X1 = X4 ) ),
inference(assume_negation,[status(cth)],[less3]) ).
thf(c_0_7,plain,
! [X1: $i,X3: $i] :
( ( ( f @ $true )
= X1 )
| ( ( f @ $true )
= X3 )
| ( X1 = X3 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
thf(c_0_8,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_6])])])]) ).
thf(c_0_9,plain,
! [X5: $i,X1: $i,X3: $i,X4: $i] :
( ( ( f @ $true )
= X1 )
| ( X1 = X3 )
| ( X4 = X5 )
| ( X3 = X5 )
| ( X3 = X4 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
thf(c_0_10,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
! [X4: $i,X3: $i,X1: $i] :
( ( ( f @ $true )
= X1 )
| ( X3 = X4 )
| ( X3 = X1 )
| ( X4 = X1 ) ),
inference(ef,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
esk1_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( ( f @ $true )
= esk3_0 )
| ( X1 = esk3_0 )
| ( X1 = esk2_0 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11])]) ).
thf(c_0_14,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_15,negated_conjecture,
( ( f @ $true )
= esk3_0 ),
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]),c_0_14]) ).
thf(c_0_16,plain,
! [X3: $i,X1: $i] :
( ( esk3_0 = X1 )
| ( esk3_0 = X3 )
| ( X3 = X1 ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_15]),c_0_15]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
( ( esk2_0 = X1 )
| ( esk3_0 = X1 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16])]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV434^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n018.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 15:49:11 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 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.nqyM09K6KE/E---3.1_251954.p
% 0.08/0.25 % Version: 3.5.1-ho
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.25 % Starting sh4l with 300s (1) cores
% 0.08/0.25 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.08/0.25 % ho_unfolding_6 with pid 251968 completed with status 0
% 0.08/0.25 % Result found by ho_unfolding_6
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.25 % No SInE strategy applied
% 0.08/0.25 % Search class: HGUSF-FFSF11-SFFFFFNN
% 0.08/0.25 % partial match(1): HGUNF-FFSF11-SFFFFFNN
% 0.08/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.25 % SubtermCWHack with pid 251973 completed with status 0
% 0.08/0.25 % Result found by SubtermCWHack
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.25 % No SInE strategy applied
% 0.08/0.25 % Search class: HGUSF-FFSF11-SFFFFFNN
% 0.08/0.25 % partial match(1): HGUNF-FFSF11-SFFFFFNN
% 0.08/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.25 % Preprocessing time : 0.001 s
% 0.08/0.25
% 0.08/0.25 % Proof found!
% 0.08/0.25 % SZS status Theorem
% 0.08/0.25 % SZS output start CNFRefutation
% See solution above
% 0.08/0.25 % Parsed axioms : 3
% 0.08/0.25 % Removed by relevancy pruning/SinE : 0
% 0.08/0.25 % Initial clauses : 6
% 0.08/0.25 % Removed in clause preprocessing : 1
% 0.08/0.25 % Initial clauses in saturation : 5
% 0.08/0.25 % Processed clauses : 51
% 0.08/0.25 % ...of these trivial : 0
% 0.08/0.25 % ...subsumed : 33
% 0.08/0.25 % ...remaining for further processing : 18
% 0.08/0.25 % Other redundant clauses eliminated : 127
% 0.08/0.25 % Clauses deleted for lack of memory : 0
% 0.08/0.25 % Backward-subsumed : 1
% 0.08/0.25 % Backward-rewritten : 6
% 0.08/0.25 % Generated clauses : 612
% 0.08/0.25 % ...of the previous two non-redundant : 276
% 0.08/0.25 % ...aggressively subsumed : 0
% 0.08/0.25 % Contextual simplify-reflections : 0
% 0.08/0.25 % Paramodulations : 218
% 0.08/0.25 % Factorizations : 267
% 0.08/0.25 % NegExts : 0
% 0.08/0.25 % Equation resolutions : 127
% 0.08/0.25 % Disequality decompositions : 0
% 0.08/0.25 % Total rewrite steps : 21
% 0.08/0.25 % ...of those cached : 20
% 0.08/0.25 % Propositional unsat checks : 0
% 0.08/0.25 % Propositional check models : 0
% 0.08/0.25 % Propositional check unsatisfiable : 0
% 0.08/0.25 % Propositional clauses : 0
% 0.08/0.25 % Propositional clauses after purity: 0
% 0.08/0.25 % Propositional unsat core size : 0
% 0.08/0.25 % Propositional preprocessing time : 0.000
% 0.08/0.25 % Propositional encoding time : 0.000
% 0.08/0.25 % Propositional solver time : 0.000
% 0.08/0.25 % Success case prop preproc time : 0.000
% 0.08/0.25 % Success case prop encoding time : 0.000
% 0.08/0.25 % Success case prop solver time : 0.000
% 0.08/0.25 % Current number of processed clauses : 11
% 0.08/0.25 % Positive orientable unit clauses : 1
% 0.08/0.25 % Positive unorientable unit clauses: 0
% 0.08/0.25 % Negative unit clauses : 3
% 0.08/0.25 % Non-unit-clauses : 7
% 0.08/0.25 % Current number of unprocessed clauses: 103
% 0.08/0.25 % ...number of literals in the above : 458
% 0.08/0.25 % Current number of archived formulas : 0
% 0.08/0.25 % Current number of archived clauses : 7
% 0.08/0.25 % Clause-clause subsumption calls (NU) : 45
% 0.08/0.25 % Rec. Clause-clause subsumption calls : 37
% 0.08/0.25 % Non-unit clause-clause subsumptions : 29
% 0.08/0.25 % Unit Clause-clause subsumption calls : 2
% 0.08/0.25 % Rewrite failures with RHS unbound : 0
% 0.08/0.25 % BW rewrite match attempts : 1
% 0.08/0.25 % BW rewrite match successes : 1
% 0.08/0.25 % Condensation attempts : 0
% 0.08/0.25 % Condensation successes : 0
% 0.08/0.25 % Termbank termtop insertions : 842
% 0.08/0.25 % Search garbage collected termcells : 59
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.004 s
% 0.08/0.25 % System time : 0.003 s
% 0.08/0.25 % Total time : 0.007 s
% 0.08/0.25 % Maximum resident set size: 3628 pages
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.005 s
% 0.08/0.25 % System time : 0.006 s
% 0.08/0.25 % Total time : 0.012 s
% 0.08/0.25 % Maximum resident set size: 4608 pages
% 0.08/0.25 % E exiting
%------------------------------------------------------------------------------