%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV427^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 : n002.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:30 AM UTC 2026
% Result : Theorem 0.23s 0.34s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 25 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 51 ( 9 ~; 7 |; 1 &; 33 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 11 ( 0 ^; 10 !; 1 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
eps: ( $i > $o ) > $i ).
thf(decl_24,type,
p: $i > $o ).
thf(decl_25,type,
q: $i > $o ).
thf(conj,conjecture,
( ( p @ ( eps @ p ) )
| ( q @ ( eps @ q ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xfs7kbqs5m/E---3.1_1454382.p',conj) ).
thf(choiceax,axiom,
! [X1: $i > $o] :
( ? [X2: $i] : ( X1 @ X2 )
=> ( X1 @ ( eps @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xfs7kbqs5m/E---3.1_1454382.p',choiceax) ).
thf(pq,axiom,
! [X2: $i] :
( ( p @ X2 )
| ( q @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.xfs7kbqs5m/E---3.1_1454382.p',pq) ).
thf(c_0_3,negated_conjecture,
~ ( ( p @ ( eps @ p ) )
| ( q @ ( eps @ q ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_4,negated_conjecture,
( ~ ( p @ ( eps @ p ) )
& ~ ( q @ ( eps @ q ) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
thf(c_0_5,plain,
! [X6: $i > $o,X7: $i] :
( ~ ( X6 @ X7 )
| ( X6 @ ( eps @ X6 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax])])])]) ).
thf(c_0_6,plain,
! [X8: $i] :
( ( p @ X8 )
| ( q @ X8 ) ),
inference(variable_rename,[status(thm)],[pq]) ).
thf(c_0_7,negated_conjecture,
~ ( p @ ( eps @ p ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( eps @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
~ ( q @ ( eps @ q ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_10,plain,
! [X2: $i] :
( ( p @ X2 )
| ( q @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i] :
~ ( p @ X2 ),
inference(sr,[status(thm)],[inference(choice_inst,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X2: $i] :
~ ( q @ X2 ),
inference(sr,[status(thm)],[inference(choice_inst,[status(thm)],[c_0_9,c_0_8]),c_0_9]) ).
thf(c_0_13,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEV427^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.24 % Computer : n002.cluster.edu
% 0.10/0.24 % Model : x86_64 x86_64
% 0.10/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.24 % Memory : 8046.5625MB
% 0.10/0.24 % OS : Linux 6.8.0-71-generic
% 0.10/0.24 % CPULimit : 300
% 0.10/0.24 % WCLimit : 300
% 0.10/0.24 % DateTime : Tue Sep 29 15:49:32 UTC 2026
% 0.10/0.24 % CPUTime :
% 0.10/0.24 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.30 Running higher-order theorem proving
% 0.23/0.32 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.xfs7kbqs5m/E---3.1_1454382.p
% 0.23/0.34 % Version: 3.5.1-ho
% 0.23/0.34 % Preprocessing class: HSSSSMSSSSSCSSA.
% 0.23/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.34 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.34 % Starting new_bool_9 with 300s (1) cores
% 0.23/0.34 % Starting full_lambda_8 with 300s (1) cores
% 0.23/0.34 % Starting post_as_ho10 with 300s (1) cores
% 0.23/0.34 % full_lambda_8 with pid 1454399 completed with status 0
% 0.23/0.34 % Result found by full_lambda_8
% 0.23/0.34 % Preprocessing class: HSSSSMSSSSSCSSA.
% 0.23/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.34 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.34 % Starting new_bool_9 with 300s (1) cores
% 0.23/0.34 % Starting full_lambda_8 with 300s (1) cores
% 0.23/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.34 % No SInE strategy applied
% 0.23/0.34 % Search class: HGUNF-FFSF11-SSSFFSBC
% 0.23/0.34 % partial match(1): HGUNF-FFSF11-SSSFFSBN
% 0.23/0.34 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.34 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.34 % SubtermCWHack with pid 1454401 completed with status 0
% 0.23/0.34 % Result found by SubtermCWHack
% 0.23/0.34 % Preprocessing class: HSSSSMSSSSSCSSA.
% 0.23/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.34 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.34 % Starting new_bool_9 with 300s (1) cores
% 0.23/0.34 % Starting full_lambda_8 with 300s (1) cores
% 0.23/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.34 % No SInE strategy applied
% 0.23/0.34 % Search class: HGUNF-FFSF11-SSSFFSBC
% 0.23/0.34 % partial match(1): HGUNF-FFSF11-SSSFFSBN
% 0.23/0.34 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.34 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.34 % Preprocessing time : 0.002 s
% 0.23/0.34
% 0.23/0.34 % Proof found!
% 0.23/0.34 % SZS status Theorem
% 0.23/0.34 % SZS output start CNFRefutation
% See solution above
% 0.23/0.34 % Parsed axioms : 6
% 0.23/0.34 % Removed by relevancy pruning/SinE : 0
% 0.23/0.34 % Initial clauses : 7
% 0.23/0.34 % Removed in clause preprocessing : 3
% 0.23/0.34 % Initial clauses in saturation : 4
% 0.23/0.34 % Processed clauses : 5
% 0.23/0.34 % ...of these trivial : 0
% 0.23/0.34 % ...subsumed : 0
% 0.23/0.34 % ...remaining for further processing : 4
% 0.23/0.34 % Other redundant clauses eliminated : 0
% 0.23/0.34 % Clauses deleted for lack of memory : 0
% 0.23/0.34 % Backward-subsumed : 2
% 0.23/0.34 % Backward-rewritten : 0
% 0.23/0.34 % Generated clauses : 4
% 0.23/0.34 % ...of the previous two non-redundant : 4
% 0.23/0.34 % ...aggressively subsumed : 0
% 0.23/0.34 % Contextual simplify-reflections : 0
% 0.23/0.34 % Paramodulations : 0
% 0.23/0.34 % Factorizations : 0
% 0.23/0.34 % NegExts : 0
% 0.23/0.34 % Equation resolutions : 0
% 0.23/0.34 % Disequality decompositions : 0
% 0.23/0.34 % Total rewrite steps : 0
% 0.23/0.34 % ...of those cached : 0
% 0.23/0.34 % Propositional unsat checks : 0
% 0.23/0.34 % Propositional check models : 0
% 0.23/0.34 % Propositional check unsatisfiable : 0
% 0.23/0.34 % Propositional clauses : 0
% 0.23/0.34 % Propositional clauses after purity: 0
% 0.23/0.34 % Propositional unsat core size : 0
% 0.23/0.34 % Propositional preprocessing time : 0.000
% 0.23/0.34 % Propositional encoding time : 0.000
% 0.23/0.34 % Propositional solver time : 0.000
% 0.23/0.34 % Success case prop preproc time : 0.000
% 0.23/0.34 % Success case prop encoding time : 0.000
% 0.23/0.34 % Success case prop solver time : 0.000
% 0.23/0.34 % Current number of processed clauses : 2
% 0.23/0.34 % Positive orientable unit clauses : 0
% 0.23/0.34 % Positive unorientable unit clauses: 0
% 0.23/0.34 % Negative unit clauses : 2
% 0.23/0.34 % Non-unit-clauses : 0
% 0.23/0.34 % Current number of unprocessed clauses: 3
% 0.23/0.34 % ...number of literals in the above : 6
% 0.23/0.34 % Current number of archived formulas : 0
% 0.23/0.34 % Current number of archived clauses : 2
% 0.23/0.34 % Clause-clause subsumption calls (NU) : 0
% 0.23/0.34 % Rec. Clause-clause subsumption calls : 0
% 0.23/0.34 % Non-unit clause-clause subsumptions : 0
% 0.23/0.34 % Unit Clause-clause subsumption calls : 2
% 0.23/0.34 % Rewrite failures with RHS unbound : 0
% 0.23/0.34 % BW rewrite match attempts : 0
% 0.23/0.34 % BW rewrite match successes : 0
% 0.23/0.34 % Condensation attempts : 0
% 0.23/0.34 % Condensation successes : 0
% 0.23/0.34 % Termbank termtop insertions : 317
% 0.23/0.34 % Search garbage collected termcells : 38
% 0.23/0.34
% 0.23/0.34 % -------------------------------------------------
% 0.23/0.34 % User time : 0.003 s
% 0.23/0.34 % System time : 0.002 s
% 0.23/0.34 % Total time : 0.006 s
% 0.23/0.34 % Maximum resident set size: 3884 pages
% 0.23/0.34
% 0.23/0.34 % -------------------------------------------------
% 0.23/0.34 % User time : 0.005 s
% 0.23/0.34 % System time : 0.007 s
% 0.23/0.34 % Total time : 0.012 s
% 0.23/0.34 % Maximum resident set size: 4864 pages
% 0.23/0.34 % E exiting
%------------------------------------------------------------------------------