%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV256^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:17 AM UTC 2026
% Result : Theorem 0.24s 0.33s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 0 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 68 ( 12 ~; 3 |; 8 &; 36 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 12 ^; 8 !; 6 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
cOPEN: ( a > $o ) > $o ).
thf(decl_24,type,
epred1_1: ( ( a > $o ) > $o ) > a > $o ).
thf(cTHM625A_pme,conjecture,
( ! [X1: ( a > $o ) > $o] :
( ! [X2: a > $o] :
( ( X1 @ X2 )
=> ( cOPEN @ X2 ) )
=> ( cOPEN
@ ^ [X3: a] :
? [X4: a > $o] :
( ( X1 @ X4 )
& ( X4 @ X3 ) ) ) )
=> ( cOPEN
@ ^ [X5: a] : ~ $true ) ),
file('/export/starexec/sandbox2/tmp/tmp.HmiwPvT3Uu/E---3.1_1185272.p',cTHM625A_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: ( a > $o ) > $o] :
( ! [X2: a > $o] :
( ( X1 @ X2 )
=> ( cOPEN @ X2 ) )
=> ( cOPEN
@ ^ [X3: a] :
? [X4: a > $o] :
( ( X1 @ X4 )
& ( X4 @ X3 ) ) ) )
=> ( cOPEN
@ ^ [X5: a] : ~ $true ) ),
inference(assume_negation,[status(cth)],[cTHM625A_pme]) ).
thf(c_0_2,negated_conjecture,
~ ( ! [X1: ( a > $o ) > $o] :
( ! [X2: a > $o] :
( ( X1 @ X2 )
=> ( cOPEN @ X2 ) )
=> ( cOPEN
@ ^ [Z0: a] :
? [X4: a > $o] :
( ( X1 @ X4 )
& ( X4 @ Z0 ) ) ) )
=> ( cOPEN
@ ^ [Z0: a] : ~ $true ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X8: ( a > $o ) > $o] :
( ( ( X8 @ ( epred1_1 @ X8 ) )
| ( cOPEN
@ ^ [Z0: a] :
? [X4: a > $o] :
( ( X8 @ X4 )
& ( X4 @ Z0 ) ) ) )
& ( ~ ( cOPEN @ ( epred1_1 @ X8 ) )
| ( cOPEN
@ ^ [Z0: a] :
? [X4: a > $o] :
( ( X8 @ X4 )
& ( X4 @ Z0 ) ) ) )
& ~ ( cOPEN
@ ^ [Z0: a] : ~ $true ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
thf(c_0_4,negated_conjecture,
~ ( cOPEN
@ ^ [Z0: a] : ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X1: ( a > $o ) > $o] :
( ( X1 @ ( epred1_1 @ X1 ) )
| ( cOPEN
@ ^ [Z0: a] :
? [X17: a > $o] :
( ( X1 @ X17 )
& ( X17 @ Z0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
~ ( cOPEN
@ ^ [Z0: a] : ~ $true ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(primitive_enumeration,[status(thm)],[c_0_5])]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV256^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 % Computer : n020.cluster.edu
% 0.08/0.21 % Model : x86_64 x86_64
% 0.08/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.21 % Memory : 8046.5625MB
% 0.08/0.21 % OS : Linux 6.8.0-71-generic
% 0.08/0.21 % CPULimit : 300
% 0.08/0.21 % WCLimit : 300
% 0.08/0.21 % DateTime : Tue Sep 29 15:28:49 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.28 Running higher-order theorem proving
% 0.24/0.30 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.HmiwPvT3Uu/E---3.1_1185272.p
% 0.24/0.33 % Version: 3.5.1-ho
% 0.24/0.33 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.24/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.33 % Starting post_as_ho5 with 1500s (5) cores
% 0.24/0.33 % Starting sh2lt with 300s (1) cores
% 0.24/0.33 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.24/0.33 % Starting post_as_ho10 with 300s (1) cores
% 0.24/0.33 % post_as_ho5 with pid 1185285 completed with status 0
% 0.24/0.33 % Result found by post_as_ho5
% 0.24/0.33 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.24/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.33 % Starting post_as_ho5 with 1500s (5) cores
% 0.24/0.33 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.24/0.33 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.24/0.33 % Search class: HGUNF-FFSF00-MHHFFSBN
% 0.24/0.33 % partial match(1): HGUNF-FFSF00-SHHFFSBN
% 0.24/0.33 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.33 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.33 % Starting post_as_ho5 with 151s (1) cores
% 0.24/0.33 % Starting lpo8_lambda_fix with 169s (1) cores
% 0.24/0.33 % Starting ehoh_best2_full_lfho with 169s (1) cores
% 0.24/0.33 % Starting lpo8_s with 169s (1) cores
% 0.24/0.33 % SubtermCWHack with pid 1185289 completed with status 10
% 0.24/0.33 % Starting lpo9_lambda_fix with 169s (1) cores
% 0.24/0.33 % ehoh_best2_full_lfho with pid 1185293 completed with status 0
% 0.24/0.33 % Result found by ehoh_best2_full_lfho
% 0.24/0.33 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.24/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.33 % Starting post_as_ho5 with 1500s (5) cores
% 0.24/0.33 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.24/0.33 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.24/0.33 % Search class: HGUNF-FFSF00-MHHFFSBN
% 0.24/0.33 % partial match(1): HGUNF-FFSF00-SHHFFSBN
% 0.24/0.33 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.33 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.33 % Starting post_as_ho5 with 151s (1) cores
% 0.24/0.33 % Starting lpo8_lambda_fix with 169s (1) cores
% 0.24/0.33 % Starting ehoh_best2_full_lfho with 169s (1) cores
% 0.24/0.33 % Preprocessing time : 0.002 s
% 0.24/0.33
% 0.24/0.33 % Proof found!
% 0.24/0.33 % SZS status Theorem
% 0.24/0.33 % SZS output start CNFRefutation
% See solution above
% 0.24/0.33 % Parsed axioms : 3
% 0.24/0.33 % Removed by relevancy pruning/SinE : 2
% 0.24/0.33 % Initial clauses : 3
% 0.24/0.33 % Removed in clause preprocessing : 0
% 0.24/0.33 % Initial clauses in saturation : 3
% 0.24/0.33 % Processed clauses : 3
% 0.24/0.33 % ...of these trivial : 0
% 0.24/0.33 % ...subsumed : 0
% 0.24/0.33 % ...remaining for further processing : 3
% 0.24/0.33 % Other redundant clauses eliminated : 0
% 0.24/0.33 % Clauses deleted for lack of memory : 0
% 0.24/0.33 % Backward-subsumed : 0
% 0.24/0.33 % Backward-rewritten : 0
% 0.24/0.33 % Generated clauses : 12
% 0.24/0.33 % ...of the previous two non-redundant : 10
% 0.24/0.33 % ...aggressively subsumed : 0
% 0.24/0.33 % Contextual simplify-reflections : 0
% 0.24/0.33 % Paramodulations : 0
% 0.24/0.33 % Factorizations : 0
% 0.24/0.33 % NegExts : 0
% 0.24/0.33 % Equation resolutions : 0
% 0.24/0.33 % Disequality decompositions : 0
% 0.24/0.33 % Total rewrite steps : 0
% 0.24/0.33 % ...of those cached : 0
% 0.24/0.33 % Propositional unsat checks : 0
% 0.24/0.33 % Propositional check models : 0
% 0.24/0.33 % Propositional check unsatisfiable : 0
% 0.24/0.33 % Propositional clauses : 0
% 0.24/0.33 % Propositional clauses after purity: 0
% 0.24/0.33 % Propositional unsat core size : 0
% 0.24/0.33 % Propositional preprocessing time : 0.000
% 0.24/0.33 % Propositional encoding time : 0.000
% 0.24/0.33 % Propositional solver time : 0.000
% 0.24/0.33 % Success case prop preproc time : 0.000
% 0.24/0.33 % Success case prop encoding time : 0.000
% 0.24/0.33 % Success case prop solver time : 0.000
% 0.24/0.33 % Current number of processed clauses : 3
% 0.24/0.33 % Positive orientable unit clauses : 0
% 0.24/0.33 % Positive unorientable unit clauses: 0
% 0.24/0.33 % Negative unit clauses : 1
% 0.24/0.33 % Non-unit-clauses : 2
% 0.24/0.33 % Current number of unprocessed clauses: 3
% 0.24/0.33 % ...number of literals in the above : 8
% 0.24/0.33 % Current number of archived formulas : 0
% 0.24/0.33 % Current number of archived clauses : 0
% 0.24/0.33 % Clause-clause subsumption calls (NU) : 0
% 0.24/0.33 % Rec. Clause-clause subsumption calls : 0
% 0.24/0.33 % Non-unit clause-clause subsumptions : 0
% 0.24/0.33 % Unit Clause-clause subsumption calls : 0
% 0.24/0.33 % Rewrite failures with RHS unbound : 0
% 0.24/0.33 % BW rewrite match attempts : 0
% 0.24/0.33 % BW rewrite match successes : 0
% 0.24/0.33 % Condensation attempts : 0
% 0.24/0.33 % Condensation successes : 0
% 0.24/0.33 % Termbank termtop insertions : 1239
% 0.24/0.33 % Search garbage collected termcells : 108
% 0.24/0.33
% 0.24/0.33 % -------------------------------------------------
% 0.24/0.33 % User time : 0.003 s
% 0.24/0.33 % System time : 0.007 s
% 0.24/0.33 % Total time : 0.010 s
% 0.24/0.33 % Maximum resident set size: 3632 pages
% 0.24/0.33
% 0.24/0.33 % -------------------------------------------------
% 0.24/0.33 % User time : 0.013 s
% 0.24/0.33 % System time : 0.018 s
% 0.24/0.33 % Total time : 0.032 s
% 0.24/0.33 % Maximum resident set size: 4864 pages
% 0.24/0.33 % E exiting
%------------------------------------------------------------------------------