%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO547^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 : 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 : Wed Sep 30 08:43:23 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 2 equ; 0 cnn)
% Maximal formula atoms : 3 ( 0 avg)
% Number of connectives : 56 ( 17 ~; 2 |; 1 &; 32 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 7 ^; 9 !; 4 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
eps: ( $i > $o ) > $i ).
thf(decl_24,type,
epscomp: ( $i > $o ) > $i ).
thf(decl_25,type,
epred1_0: $i > $o ).
thf(decl_26,type,
esk1_0: $i ).
thf(choicecomp,conjecture,
! [X1: $i > $o] :
( ? [X2: $i] :
~ ( X1 @ X2 )
=> ~ ( X1 @ ( epscomp @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.sodOhLFw0T/E---3.1_1542588.p',choicecomp) ).
thf(epscompd,axiom,
( epscomp
= ( ^ [X1: $i > $o] :
( eps
@ ^ [X2: $i] :
~ ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.sodOhLFw0T/E---3.1_1542588.p',epscompd) ).
thf(choiceax,axiom,
! [X1: $i > $o] :
( ? [X2: $i] : ( X1 @ X2 )
=> ( X1 @ ( eps @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.sodOhLFw0T/E---3.1_1542588.p',choiceax) ).
thf(c_0_3,negated_conjecture,
~ ! [X1: $i > $o] :
( ? [X2: $i] :
~ ( X1 @ X2 )
=> ~ ( X1 @ ( epscomp @ X1 ) ) ),
inference(assume_negation,[status(cth)],[choicecomp]) ).
thf(c_0_4,plain,
( epscomp
= ( ^ [Z0: $i > $o] :
( eps
@ ^ [Z1: $i] :
~ ( Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[epscompd]) ).
thf(c_0_5,negated_conjecture,
~ ! [X1: $i > $o] :
( ? [X2: $i] :
~ ( X1 @ X2 )
=> ~ ( X1
@ ( eps
@ ^ [Z0: $i] :
~ ( X1 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[c_0_3,c_0_4])]) ).
thf(c_0_6,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
& ( epred1_0
@ ( eps
@ ^ [Z0: $i] :
~ ( epred1_0 @ Z0 ) ) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
thf(c_0_7,plain,
! [X9: $i > $o,X10: $i] :
( ~ ( X9 @ X10 )
| ( X9 @ ( eps @ X9 ) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax])])]) ).
thf(c_0_8,negated_conjecture,
( epred1_0
@ ( eps
@ ^ [Z0: $i] :
~ ( epred1_0 @ Z0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( eps @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
~ ( epred1_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i] : ( epred1_0 @ X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(choice_inst,[status(thm)],[inference(cn,[status(thm)],[]),c_0_8,c_0_9]),c_0_8])]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO547^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 : n001.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 17:20:06 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.24 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.sodOhLFw0T/E---3.1_1542588.p
% 0.08/0.25 % Version: 3.5.1-ho
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSSCHSA.
% 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 sh5l with 300s (1) cores
% 0.08/0.25 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.25 % Starting new_bool_2 with 300s (1) cores
% 0.08/0.25 % new_bool_2 with pid 1542604 completed with status 0
% 0.08/0.25 % Result found by new_bool_2
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSSCHSA.
% 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 sh5l with 300s (1) cores
% 0.08/0.25 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.25 % Starting new_bool_2 with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.25 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.25 % Search class: HHUNF-FFSF11-MHSFFSBC
% 0.08/0.25 % partial match(3): HHUNF-FFSF11-SHHFFSBN
% 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 1542605 completed with status 0
% 0.08/0.25 % Result found by SubtermCWHack
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSSCHSA.
% 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 sh5l with 300s (1) cores
% 0.08/0.25 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.25 % Starting new_bool_2 with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.25 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.25 % Search class: HHUNF-FFSF11-MHSFFSBC
% 0.08/0.25 % partial match(3): HHUNF-FFSF11-SHHFFSBN
% 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 : 5
% 0.08/0.25 % Removed by relevancy pruning/SinE : 2
% 0.08/0.25 % Initial clauses : 3
% 0.08/0.25 % Removed in clause preprocessing : 0
% 0.08/0.25 % Initial clauses in saturation : 3
% 0.08/0.25 % Processed clauses : 4
% 0.08/0.25 % ...of these trivial : 0
% 0.08/0.25 % ...subsumed : 0
% 0.08/0.25 % ...remaining for further processing : 4
% 0.08/0.25 % Other redundant clauses eliminated : 0
% 0.08/0.25 % Clauses deleted for lack of memory : 0
% 0.08/0.25 % Backward-subsumed : 0
% 0.08/0.25 % Backward-rewritten : 2
% 0.08/0.25 % Generated clauses : 4
% 0.08/0.25 % ...of the previous two non-redundant : 3
% 0.08/0.25 % ...aggressively subsumed : 0
% 0.08/0.25 % Contextual simplify-reflections : 0
% 0.08/0.25 % Paramodulations : 2
% 0.08/0.25 % Factorizations : 0
% 0.08/0.25 % NegExts : 0
% 0.08/0.25 % Equation resolutions : 0
% 0.08/0.25 % Disequality decompositions : 0
% 0.08/0.25 % Total rewrite steps : 3
% 0.08/0.25 % ...of those cached : 0
% 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 : 2
% 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 : 0
% 0.08/0.25 % Non-unit-clauses : 1
% 0.08/0.25 % Current number of unprocessed clauses: 2
% 0.08/0.25 % ...number of literals in the above : 3
% 0.08/0.25 % Current number of archived formulas : 0
% 0.08/0.25 % Current number of archived clauses : 2
% 0.08/0.25 % Clause-clause subsumption calls (NU) : 0
% 0.08/0.25 % Rec. Clause-clause subsumption calls : 0
% 0.08/0.25 % Non-unit clause-clause subsumptions : 0
% 0.08/0.25 % Unit Clause-clause subsumption calls : 0
% 0.08/0.25 % Rewrite failures with RHS unbound : 0
% 0.08/0.25 % BW rewrite match attempts : 2
% 0.08/0.25 % BW rewrite match successes : 2
% 0.08/0.25 % Condensation attempts : 0
% 0.08/0.25 % Condensation successes : 0
% 0.08/0.25 % Termbank termtop insertions : 307
% 0.08/0.25 % Search garbage collected termcells : 69
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.004 s
% 0.08/0.25 % System time : 0.000 s
% 0.08/0.25 % Total time : 0.004 s
% 0.08/0.25 % Maximum resident set size: 3576 pages
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.007 s
% 0.08/0.25 % System time : 0.003 s
% 0.08/0.25 % Total time : 0.009 s
% 0.08/0.25 % Maximum resident set size: 4608 pages
% 0.08/0.25 % E exiting
%------------------------------------------------------------------------------