%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO530^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:43:21 AM UTC 2026
% Result : Theorem 0.21s 0.29s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 5 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 111 ( 9 ~; 3 |; 1 &; 94 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 21 ^; 12 !; 21 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
eps: ( $i > $o ) > $i ).
thf(decl_24,type,
epsa: ( $i > $i > $o ) > $i ).
thf(decl_25,type,
epsb: ( $i > $i > $o ) > $i ).
thf(decl_26,type,
epred1_0: $i > $i > $o ).
thf(decl_27,type,
esk1_0: $i ).
thf(decl_28,type,
esk2_0: $i ).
thf(epsbd,axiom,
( epsb
= ( ^ [X3: $i > $i > $o] :
( eps
@ ^ [X4: $i] : ( X3 @ ( epsa @ X3 ) @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gLGjN7h3qg/E---3.1_367735.p',epsbd) ).
thf(epsad,axiom,
( epsa
= ( ^ [X3: $i > $i > $o] :
( eps
@ ^ [X2: $i] :
? [X4: $i] : ( X3 @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gLGjN7h3qg/E---3.1_367735.p',epsad) ).
thf(conj,conjecture,
! [X3: $i > $i > $o] :
( ? [X2: $i,X4: $i] : ( X3 @ X2 @ X4 )
=> ( X3 @ ( epsa @ X3 ) @ ( epsb @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gLGjN7h3qg/E---3.1_367735.p',conj) ).
thf(choiceax,axiom,
! [X1: $i > $o] :
( ? [X2: $i] : ( X1 @ X2 )
=> ( X1 @ ( eps @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gLGjN7h3qg/E---3.1_367735.p',choiceax) ).
thf(c_0_4,plain,
( epsb
= ( ^ [Z0: $i > $i > $o] :
( eps
@ ^ [Z1: $i] :
( Z0
@ ( eps
@ ^ [Z2: $i] :
? [X10: $i] : ( Z0 @ Z2 @ X10 ) )
@ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[epsbd]) ).
thf(c_0_5,plain,
( epsa
= ( ^ [Z0: $i > $i > $o] :
( eps
@ ^ [Z1: $i] :
? [X4: $i] : ( Z0 @ Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[epsad]) ).
thf(c_0_6,negated_conjecture,
~ ! [X3: $i > $i > $o] :
( ? [X2: $i,X4: $i] : ( X3 @ X2 @ X4 )
=> ( X3 @ ( epsa @ X3 ) @ ( epsb @ X3 ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_7,plain,
( epsb
= ( ^ [Z0: $i > $i > $o] :
( eps
@ ^ [Z1: $i] :
( Z0
@ ( eps
@ ^ [Z2: $i] :
? [X10: $i] : ( Z0 @ Z2 @ X10 ) )
@ Z1 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,negated_conjecture,
~ ! [X3: $i > $i > $o] :
( ? [X2: $i,X4: $i] : ( X3 @ X2 @ X4 )
=> ( X3
@ ( eps
@ ^ [Z0: $i] :
? [X11: $i] : ( X3 @ Z0 @ X11 ) )
@ ( eps
@ ^ [Z0: $i] :
( X3
@ ( eps
@ ^ [Z1: $i] :
? [X12: $i] : ( X3 @ Z1 @ X12 ) )
@ Z0 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6,c_0_5]),c_0_7]) ).
thf(c_0_9,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk2_0 )
& ~ ( epred1_0
@ ( eps
@ ^ [Z0: $i] :
? [X11: $i] : ( epred1_0 @ Z0 @ X11 ) )
@ ( eps
@ ( epred1_0
@ ( eps
@ ^ [Z0: $i] :
? [X12: $i] : ( epred1_0 @ Z0 @ X12 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
thf(c_0_10,plain,
! [X13: $i > $o,X14: $i] :
( ~ ( X13 @ X14 )
| ( X13 @ ( eps @ X13 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax])])])]) ).
thf(c_0_11,negated_conjecture,
~ ( epred1_0
@ ( eps
@ ^ [Z0: $i] :
? [X24: $i] : ( epred1_0 @ Z0 @ X24 ) )
@ ( eps
@ ( epred1_0
@ ( eps
@ ^ [Z0: $i] :
? [X25: $i] : ( epred1_0 @ Z0 @ X25 ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,plain,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( eps @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X2: $i] :
( ? [X26: $i] :
( epred1_0
@ ( eps
@ ^ [Z0: $i] :
? [X27: $i] : ( epred1_0 @ Z0 @ X27 ) )
@ X26 )
| ~ ? [X28: $i] : ( epred1_0 @ X2 @ X28 ) ),
inference(choice_inst,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X2: $i] :
~ ( epred1_0
@ ( eps
@ ^ [Z0: $i] :
? [X29: $i] : ( epred1_0 @ Z0 @ X29 ) )
@ X2 ),
inference(sr,[status(thm)],[inference(choice_inst,[status(thm)],[c_0_11,c_0_12]),c_0_11]) ).
thf(c_0_15,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_16,negated_conjecture,
! [X2: $i,X4: $i] :
~ ( epred1_0 @ X2 @ X4 ),
inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_13]),c_0_14]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO530^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.20 % Computer : n018.cluster.edu
% 0.07/0.20 % Model : x86_64 x86_64
% 0.07/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.20 % Memory : 8046.5625MB
% 0.07/0.20 % OS : Linux 6.8.0-71-generic
% 0.07/0.20 % CPULimit : 300
% 0.07/0.20 % WCLimit : 300
% 0.07/0.20 % DateTime : Tue Sep 29 17:15:11 UTC 2026
% 0.07/0.21 % CPUTime :
% 0.07/0.21 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.25 Running higher-order theorem proving
% 0.21/0.27 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.gLGjN7h3qg/E---3.1_367735.p
% 0.21/0.29 % Version: 3.5.1-ho
% 0.21/0.29 % Preprocessing class: HSSSSMSSSSMCHSA.
% 0.21/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.29 % Starting lpo8_s with 1500s (5) cores
% 0.21/0.29 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.21/0.29 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.21/0.29 % Starting sh1 with 300s (1) cores
% 0.21/0.29 % ehoh_best_nonlift_rwall with pid 367749 completed with status 0
% 0.21/0.29 % Result found by ehoh_best_nonlift_rwall
% 0.21/0.29 % Preprocessing class: HSSSSMSSSSMCHSA.
% 0.21/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.29 % Starting lpo8_s with 1500s (5) cores
% 0.21/0.29 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.21/0.29 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.21/0.29 % No SInE strategy applied
% 0.21/0.29 % Search class: HHUNF-FFSF11-DHSFFSBC
% 0.21/0.29 % partial match(3): HHUNF-FFSF11-SHHFFSBN
% 0.21/0.29 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.29 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.29 % SubtermCWHack with pid 367752 completed with status 0
% 0.21/0.29 % Result found by SubtermCWHack
% 0.21/0.29 % Preprocessing class: HSSSSMSSSSMCHSA.
% 0.21/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.29 % Starting lpo8_s with 1500s (5) cores
% 0.21/0.29 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.21/0.29 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.21/0.29 % No SInE strategy applied
% 0.21/0.29 % Search class: HHUNF-FFSF11-DHSFFSBC
% 0.21/0.29 % partial match(3): HHUNF-FFSF11-SHHFFSBN
% 0.21/0.29 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.29 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.29 % Preprocessing time : 0.001 s
% 0.21/0.29
% 0.21/0.29 % Proof found!
% 0.21/0.29 % SZS status Theorem
% 0.21/0.29 % SZS output start CNFRefutation
% See solution above
% 0.21/0.29 % Parsed axioms : 7
% 0.21/0.29 % Removed by relevancy pruning/SinE : 0
% 0.21/0.29 % Initial clauses : 6
% 0.21/0.29 % Removed in clause preprocessing : 3
% 0.21/0.29 % Initial clauses in saturation : 3
% 0.21/0.29 % Processed clauses : 8
% 0.21/0.29 % ...of these trivial : 0
% 0.21/0.29 % ...subsumed : 0
% 0.21/0.29 % ...remaining for further processing : 8
% 0.21/0.29 % Other redundant clauses eliminated : 0
% 0.21/0.29 % Clauses deleted for lack of memory : 0
% 0.21/0.29 % Backward-subsumed : 3
% 0.21/0.29 % Backward-rewritten : 0
% 0.21/0.29 % Generated clauses : 13
% 0.21/0.29 % ...of the previous two non-redundant : 9
% 0.21/0.29 % ...aggressively subsumed : 0
% 0.21/0.29 % Contextual simplify-reflections : 0
% 0.21/0.29 % Paramodulations : 2
% 0.21/0.29 % Factorizations : 0
% 0.21/0.29 % NegExts : 0
% 0.21/0.29 % Equation resolutions : 0
% 0.21/0.29 % Disequality decompositions : 0
% 0.21/0.29 % Total rewrite steps : 2
% 0.21/0.29 % ...of those cached : 1
% 0.21/0.29 % Propositional unsat checks : 0
% 0.21/0.29 % Propositional check models : 0
% 0.21/0.29 % Propositional check unsatisfiable : 0
% 0.21/0.29 % Propositional clauses : 0
% 0.21/0.29 % Propositional clauses after purity: 0
% 0.21/0.29 % Propositional unsat core size : 0
% 0.21/0.29 % Propositional preprocessing time : 0.000
% 0.21/0.29 % Propositional encoding time : 0.000
% 0.21/0.29 % Propositional solver time : 0.000
% 0.21/0.29 % Success case prop preproc time : 0.000
% 0.21/0.29 % Success case prop encoding time : 0.000
% 0.21/0.29 % Success case prop solver time : 0.000
% 0.21/0.29 % Current number of processed clauses : 2
% 0.21/0.29 % Positive orientable unit clauses : 0
% 0.21/0.29 % Positive unorientable unit clauses: 0
% 0.21/0.29 % Negative unit clauses : 1
% 0.21/0.29 % Non-unit-clauses : 1
% 0.21/0.29 % Current number of unprocessed clauses: 4
% 0.21/0.29 % ...number of literals in the above : 8
% 0.21/0.29 % Current number of archived formulas : 0
% 0.21/0.29 % Current number of archived clauses : 6
% 0.21/0.29 % Clause-clause subsumption calls (NU) : 1
% 0.21/0.29 % Rec. Clause-clause subsumption calls : 1
% 0.21/0.29 % Non-unit clause-clause subsumptions : 0
% 0.21/0.29 % Unit Clause-clause subsumption calls : 3
% 0.21/0.29 % Rewrite failures with RHS unbound : 0
% 0.21/0.29 % BW rewrite match attempts : 0
% 0.21/0.29 % BW rewrite match successes : 0
% 0.21/0.29 % Condensation attempts : 0
% 0.21/0.29 % Condensation successes : 0
% 0.21/0.29 % Termbank termtop insertions : 1053
% 0.21/0.29 % Search garbage collected termcells : 166
% 0.21/0.29
% 0.21/0.29 % -------------------------------------------------
% 0.21/0.29 % User time : 0.006 s
% 0.21/0.29 % System time : 0.000 s
% 0.21/0.29 % Total time : 0.006 s
% 0.21/0.29 % Maximum resident set size: 3636 pages
% 0.21/0.29
% 0.21/0.29 % -------------------------------------------------
% 0.21/0.29 % User time : 0.007 s
% 0.21/0.29 % System time : 0.006 s
% 0.21/0.29 % Total time : 0.013 s
% 0.21/0.29 % Maximum resident set size: 4864 pages
% 0.21/0.29 % E exiting
%------------------------------------------------------------------------------