%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO026^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:42:10 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 31 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 89 ( 4 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 96 ( 35 ~; 8 |; 13 &; 34 @)
% ( 0 <=>; 3 =>; 0 <=; 3 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 7 con; 0-2 aty)
% Number of variables : 24 ( 21 ^; 3 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
p: ( $o > $o ) > $o ).
thf(decl_24,type,
epred1_0: $o > $o ).
thf(decl_25,type,
esk2_0: $o ).
thf(decl_26,type,
esk3_0: $o ).
thf(decl_27,type,
esk4_0: $o ).
thf(decl_28,type,
esk5_0: $o ).
thf(conj,conjecture,
( ( ( p
@ ^ [X1: $o] : X1 )
& ( p
@ ^ [X1: $o] : ~ X1 )
& ( p
@ ^ [X1: $o] : ~ $true )
& ( p
@ ^ [X1: $o] : $true ) )
=> ! [X2: $o > $o] : ( p @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.sxd8NUg57K/E---3.1_1503607.p',conj) ).
thf(c_0_1,negated_conjecture,
~ ( ( ( p
@ ^ [X1: $o] : X1 )
& ( p
@ ^ [X1: $o] : ~ X1 )
& ( p
@ ^ [X1: $o] : ~ $true )
& ( p
@ ^ [X1: $o] : $true ) )
=> ! [X2: $o > $o] : ( p @ X2 ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_2,negated_conjecture,
~ ( ( ( p
@ ^ [Z0: $o] : Z0 )
& ( p @ $not )
& ( p
@ ^ [Z0: $o] : ~ $true )
& ( p
@ ^ [Z0: $o] : $true ) )
=> ! [X2: $o > $o] : ( p @ X2 ) ),
inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
( ( p
@ ^ [Z0: $o] : Z0 )
& ( p @ $not )
& ( p
@ ^ [Z0: $o] : ~ $true )
& ( p
@ ^ [Z0: $o] : $true )
& ~ ( p @ epred1_0 ) ),
inference(fof_nnf,[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,
~ ( p @ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( p
@ ^ [Z0: $o] : Z0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
p @ $not,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
( p
@ ^ [Z0: $o] : ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,plain,
( ( ^ [Z0: $o] : Z0 )
!= epred1_0 ),
inference(ext_sup,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_9,plain,
$not != epred1_0,
inference(ext_sup,[status(thm)],[c_0_4,c_0_6]) ).
thf(c_0_10,negated_conjecture,
( p
@ ^ [Z0: $o] : ~ $true ),
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
( p
@ ^ [Z0: $o] : $true ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_12,plain,
( ( epred1_0 @ esk5_0 )
<~> esk5_0 ),
inference(neg_ext,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
( ~ esk2_0
<~> ( epred1_0 @ esk2_0 ) ),
inference(neg_ext,[status(thm)],[c_0_9]) ).
thf(c_0_14,plain,
( ( ^ [Z0: $o] : ~ $true )
!= epred1_0 ),
inference(ext_sup,[status(thm)],[c_0_4,c_0_10]) ).
thf(c_0_15,plain,
( ( ^ [Z0: $o] : $true )
!= epred1_0 ),
inference(ext_sup,[status(thm)],[c_0_4,c_0_11]) ).
thf(c_0_16,plain,
( ~ ( epred1_0 @ $true )
| ~ esk5_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])]) ).
thf(c_0_17,plain,
( ( epred1_0 @ $true )
| ~ esk2_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_13])]) ).
thf(c_0_18,plain,
( esk2_0
| ~ ( epred1_0 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_13])]) ).
thf(c_0_19,plain,
epred1_0 @ esk4_0,
inference(neg_ext,[status(thm)],[c_0_14]) ).
thf(c_0_20,plain,
~ ( epred1_0 @ esk3_0 ),
inference(neg_ext,[status(thm)],[c_0_15]) ).
thf(c_0_21,plain,
( ~ esk5_0
| ~ esk2_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,plain,
( esk2_0
| esk4_0 ),
inference(ext_sup,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_23,plain,
( ~ esk4_0
| ~ esk5_0 ),
inference(ext_sup,[status(thm)],[c_0_16,c_0_19]) ).
thf(c_0_24,plain,
( esk3_0
<~> esk4_0 ),
inference(ext_sup,[status(thm)],[c_0_20,c_0_19]) ).
thf(c_0_25,plain,
~ esk5_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
thf(c_0_26,plain,
( ~ esk3_0
| ~ esk2_0 ),
inference(ext_sup,[status(thm)],[c_0_20,c_0_17]) ).
thf(c_0_27,plain,
( ~ esk3_0
| ~ esk4_0 ),
inference(dynamic_cnf,[status(thm)],[c_0_24]) ).
thf(c_0_28,plain,
epred1_0 @ ~ $true,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])]),c_0_25]) ).
thf(c_0_29,plain,
~ esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_27]) ).
thf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_20,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO026^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n004.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 16:22:26 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 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.sxd8NUg57K/E---3.1_1503607.p
% 0.08/0.25 % Version: 3.5.1-ho
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSMCSSN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting post_as_ho5 with 1500s (5) cores
% 0.08/0.25 % Starting sh5l with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho10 with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho4 with 300s (1) cores
% 0.08/0.25 % post_as_ho5 with pid 1503620 completed with status 0
% 0.08/0.25 % Result found by post_as_ho5
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSMCSSN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting post_as_ho5 with 1500s (5) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.08/0.25 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.08/0.25 % Search class: HUUNF-FFSS00-SSSFFFNN
% 0.08/0.25 % partial match(1): HUUNF-FFSF00-SSSFFFNN
% 0.08/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.25 % Starting post_as_ho5 with 151s (1) cores
% 0.08/0.25 % Starting sh5l with 136s (1) cores
% 0.08/0.25 % Starting new_bool_1 with 136s (1) cores
% 0.08/0.25 % Starting new_bool_2 with 136s (1) cores
% 0.08/0.25 % SubtermCWHack with pid 1503624 completed with status 10
% 0.08/0.25 % Starting new_bool_9 with 136s (1) cores
% 0.08/0.25 % sh5l with pid 1503627 completed with status 10
% 0.08/0.25 % Starting new_ho_10 with 669s (1) cores
% 0.08/0.25 % post_as_ho5 with pid 1503626 completed with status 0
% 0.08/0.25 % Result found by post_as_ho5
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSMCSSN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting post_as_ho5 with 1500s (5) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.08/0.25 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.08/0.25 % Search class: HUUNF-FFSS00-SSSFFFNN
% 0.08/0.25 % partial match(1): HUUNF-FFSF00-SSSFFFNN
% 0.08/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.25 % Starting post_as_ho5 with 151s (1) cores
% 0.08/0.25 % Preprocessing time : 0.001 s
% 0.08/0.25 % Presaturation interreduction done
% 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 : 2
% 0.08/0.25 % Removed by relevancy pruning/SinE : 1
% 0.08/0.25 % Initial clauses : 5
% 0.08/0.25 % Removed in clause preprocessing : 0
% 0.08/0.25 % Initial clauses in saturation : 5
% 0.08/0.25 % Processed clauses : 35
% 0.08/0.25 % ...of these trivial : 0
% 0.08/0.25 % ...subsumed : 3
% 0.08/0.25 % ...remaining for further processing : 32
% 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 : 6
% 0.08/0.25 % Backward-rewritten : 3
% 0.08/0.25 % Generated clauses : 33
% 0.08/0.25 % ...of the previous two non-redundant : 26
% 0.08/0.25 % ...aggressively subsumed : 0
% 0.08/0.25 % Contextual simplify-reflections : 2
% 0.08/0.25 % Paramodulations : 3
% 0.08/0.25 % Factorizations : 0
% 0.08/0.25 % NegExts : 4
% 0.08/0.25 % Equation resolutions : 0
% 0.08/0.25 % Disequality decompositions : 0
% 0.08/0.25 % Total rewrite steps : 4
% 0.08/0.25 % ...of those cached : 1
% 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 : 15
% 0.08/0.25 % Positive orientable unit clauses : 7
% 0.08/0.25 % Positive unorientable unit clauses: 0
% 0.08/0.25 % Negative unit clauses : 8
% 0.08/0.25 % Non-unit-clauses : 0
% 0.08/0.25 % Current number of unprocessed clauses: 0
% 0.08/0.25 % ...number of literals in the above : 0
% 0.08/0.25 % Current number of archived formulas : 0
% 0.08/0.25 % Current number of archived clauses : 17
% 0.08/0.25 % Clause-clause subsumption calls (NU) : 25
% 0.08/0.25 % Rec. Clause-clause subsumption calls : 25
% 0.08/0.25 % Non-unit clause-clause subsumptions : 3
% 0.08/0.25 % Unit Clause-clause subsumption calls : 34
% 0.08/0.25 % Rewrite failures with RHS unbound : 0
% 0.08/0.25 % BW rewrite match attempts : 9
% 0.08/0.25 % BW rewrite match successes : 3
% 0.08/0.25 % Condensation attempts : 0
% 0.08/0.25 % Condensation successes : 0
% 0.08/0.25 % Termbank termtop insertions : 990
% 0.08/0.25 % Search garbage collected termcells : 79
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.007 s
% 0.08/0.25 % System time : 0.005 s
% 0.08/0.25 % Total time : 0.012 s
% 0.08/0.25 % Maximum resident set size: 3884 pages
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.011 s
% 0.08/0.25 % System time : 0.013 s
% 0.08/0.25 % Total time : 0.024 s
% 0.08/0.25 % Maximum resident set size: 4864 pages
% 0.08/0.25 % E exiting
%------------------------------------------------------------------------------