%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU960^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:26:01 AM UTC 2026
% Result : Theorem 0.26s 0.34s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 21 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 220 ( 18 ~; 20 |; 18 &; 143 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 52 ( 52 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 63 ( 28 ^; 35 !; 0 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
esk1_0: a > a ).
thf(decl_24,type,
esk2_0: a > a ).
thf(decl_25,type,
esk3_0: a > a ).
thf(decl_26,type,
esk4_1: ( ( a > a ) > $o ) > a > a ).
thf(decl_27,type,
esk5_1: ( ( a > a ) > $o ) > a > a ).
thf(decl_28,type,
epred1_0: ( a > a ) > $o ).
thf(cTHM135D_pme,conjecture,
! [X1: a > a,X2: a > a,X3: a > a] :
( ( ! [X4: ( a > a ) > $o] :
( ( ( X4 @ X1 )
& ! [X5: a > a] :
( ( X4 @ X5 )
=> ( X4
@ ^ [X6: a] : ( X1 @ ( X5 @ X6 ) ) ) ) )
=> ( X4 @ X2 ) )
& ! [X4: ( a > a ) > $o] :
( ( ( X4 @ X1 )
& ! [X5: a > a] :
( ( X4 @ X5 )
=> ( X4
@ ^ [X6: a] : ( X1 @ ( X5 @ X6 ) ) ) ) )
=> ( X4 @ X3 ) ) )
=> ! [X4: ( a > a ) > $o] :
( ( ( X4 @ X1 )
& ! [X5: a > a] :
( ( X4 @ X5 )
=> ( X4
@ ^ [X6: a] : ( X1 @ ( X5 @ X6 ) ) ) ) )
=> ( X4
@ ^ [X6: a] : ( X2 @ ( X3 @ X6 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.OxfE8AI0iB/E---3.1_2769048.p',cTHM135D_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a,X2: a > a,X3: a > a] :
( ( ! [X4: ( a > a ) > $o] :
( ( ( X4 @ X1 )
& ! [X5: a > a] :
( ( X4 @ X5 )
=> ( X4
@ ^ [X6: a] : ( X1 @ ( X5 @ X6 ) ) ) ) )
=> ( X4 @ X2 ) )
& ! [X4: ( a > a ) > $o] :
( ( ( X4 @ X1 )
& ! [X5: a > a] :
( ( X4 @ X5 )
=> ( X4
@ ^ [X6: a] : ( X1 @ ( X5 @ X6 ) ) ) ) )
=> ( X4 @ X3 ) ) )
=> ! [X4: ( a > a ) > $o] :
( ( ( X4 @ X1 )
& ! [X5: a > a] :
( ( X4 @ X5 )
=> ( X4
@ ^ [X6: a] : ( X1 @ ( X5 @ X6 ) ) ) ) )
=> ( X4
@ ^ [X6: a] : ( X2 @ ( X3 @ X6 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM135D_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: a > a,X2: a > a,X3: a > a] :
( ( ! [X4: ( a > a ) > $o] :
( ( ( X4 @ X1 )
& ! [X5: a > a] :
( ( X4 @ X5 )
=> ( X4
@ ^ [Z0: a] : ( X1 @ ( X5 @ Z0 ) ) ) ) )
=> ( X4 @ X2 ) )
& ! [X4: ( a > a ) > $o] :
( ( ( X4 @ X1 )
& ! [X5: a > a] :
( ( X4 @ X5 )
=> ( X4
@ ^ [Z0: a] : ( X1 @ ( X5 @ Z0 ) ) ) ) )
=> ( X4 @ X3 ) ) )
=> ! [X4: ( a > a ) > $o] :
( ( ( X4 @ X1 )
& ! [X5: a > a] :
( ( X4 @ X5 )
=> ( X4
@ ^ [Z0: a] : ( X1 @ ( X5 @ Z0 ) ) ) ) )
=> ( X4
@ ^ [Z0: a] : ( X2 @ ( X3 @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X19: ( a > a ) > $o,X21: ( a > a ) > $o,X24: a > a] :
( ( ( X19 @ ( esk4_1 @ X19 ) )
| ~ ( X19 @ esk1_0 )
| ( X19 @ esk2_0 ) )
& ( ~ ( X19
@ ^ [Z0: a] : ( esk1_0 @ ( esk4_1 @ X19 @ Z0 ) ) )
| ~ ( X19 @ esk1_0 )
| ( X19 @ esk2_0 ) )
& ( ( X21 @ ( esk5_1 @ X21 ) )
| ~ ( X21 @ esk1_0 )
| ( X21 @ esk3_0 ) )
& ( ~ ( X21
@ ^ [Z0: a] : ( esk1_0 @ ( esk5_1 @ X21 @ Z0 ) ) )
| ~ ( X21 @ esk1_0 )
| ( X21 @ esk3_0 ) )
& ( epred1_0 @ esk1_0 )
& ( ~ ( epred1_0 @ X24 )
| ( epred1_0
@ ^ [Z0: a] : ( esk1_0 @ ( X24 @ Z0 ) ) ) )
& ~ ( epred1_0
@ ^ [Z0: a] : ( esk2_0 @ ( esk3_0 @ Z0 ) ) ) ),
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,
! [X4: ( a > a ) > $o] :
( ( X4 @ ( esk5_1 @ X4 ) )
| ( X4 @ esk3_0 )
| ~ ( X4 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
epred1_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X1: a > a] :
( ( epred1_0
@ ^ [Z0: a] : ( esk1_0 @ ( X1 @ Z0 ) ) )
| ~ ( epred1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
( ( epred1_0 @ ( esk5_1 @ epred1_0 ) )
| ( epred1_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X4: ( a > a ) > $o] :
( ( X4 @ esk3_0 )
| ~ ( X4
@ ^ [Z0: a] : ( esk1_0 @ ( esk5_1 @ X4 @ Z0 ) ) )
| ~ ( X4 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
( ( epred1_0
@ ^ [Z0: a] : ( esk1_0 @ ( esk5_1 @ epred1_0 @ Z0 ) ) )
| ( epred1_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,negated_conjecture,
epred1_0 @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_5])]) ).
thf(c_0_11,negated_conjecture,
! [X4: ( a > a ) > $o] :
( ( X4 @ ( esk4_1 @ X4 ) )
| ( X4 @ esk2_0 )
| ~ ( X4 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_12,negated_conjecture,
( epred1_0
@ ^ [Z0: a] : ( esk1_0 @ ( esk3_0 @ Z0 ) ) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
thf(c_0_13,negated_conjecture,
~ ( epred1_0
@ ^ [Z0: a] : ( esk2_0 @ ( esk3_0 @ Z0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_14,negated_conjecture,
( epred1_0
@ ^ [Z0: a] :
( esk4_1
@ ^ [Z1: a > a] :
( epred1_0
@ ^ [Z2: a] : ( Z1 @ ( esk3_0 @ Z2 ) ) )
@ ( esk3_0 @ Z0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_15,negated_conjecture,
! [X4: ( a > a ) > $o] :
( ( X4 @ esk2_0 )
| ~ ( X4
@ ^ [Z0: a] : ( esk1_0 @ ( esk4_1 @ X4 @ Z0 ) ) )
| ~ ( X4 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_16,negated_conjecture,
( epred1_0
@ ^ [Z0: a] :
( esk1_0
@ ( esk4_1
@ ^ [Z1: a > a] :
( epred1_0
@ ^ [Z2: a] : ( Z1 @ ( esk3_0 @ Z2 ) ) )
@ ( esk3_0 @ Z0 ) ) ) ),
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU960^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 % Computer : n014.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 14:51:00 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.28 Running higher-order theorem proving
% 0.26/0.30 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.OxfE8AI0iB/E---3.1_2769048.p
% 0.26/0.34 % Version: 3.5.1-ho
% 0.26/0.34 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.26/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.34 % Starting post_as_ho5 with 1500s (5) cores
% 0.26/0.34 % Starting sh2lt with 300s (1) cores
% 0.26/0.34 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.26/0.34 % Starting post_as_ho10 with 300s (1) cores
% 0.26/0.34 % post_as_ho5 with pid 2769061 completed with status 0
% 0.26/0.34 % Result found by post_as_ho5
% 0.26/0.34 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.26/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.34 % Starting post_as_ho5 with 1500s (5) cores
% 0.26/0.34 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.26/0.34 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.26/0.34 % Search class: HGUNF-FFSF11-MHHFFMBN
% 0.26/0.34 % partial match(1): HGUNF-FFSF11-SHHFFMBN
% 0.26/0.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.34 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.34 % Starting post_as_ho5 with 151s (1) cores
% 0.26/0.34 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.26/0.34 % Starting sh5l with 136s (1) cores
% 0.26/0.34 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.34 % SubtermCWHack with pid 2769065 completed with status 10
% 0.26/0.34 % Starting new_bool_1 with 136s (1) cores
% 0.26/0.34 % post_as_ho5 with pid 2769066 completed with status 0
% 0.26/0.34 % Result found by post_as_ho5
% 0.26/0.34 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.26/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.34 % Starting post_as_ho5 with 1500s (5) cores
% 0.26/0.34 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.26/0.34 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.26/0.34 % Search class: HGUNF-FFSF11-MHHFFMBN
% 0.26/0.34 % partial match(1): HGUNF-FFSF11-SHHFFMBN
% 0.26/0.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.34 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.34 % Starting post_as_ho5 with 151s (1) cores
% 0.26/0.34 % Preprocessing time : 0.001 s
% 0.26/0.34 % Presaturation interreduction done
% 0.26/0.34
% 0.26/0.34 % Proof found!
% 0.26/0.34 % SZS status Theorem
% 0.26/0.34 % SZS output start CNFRefutation
% See solution above
% 0.26/0.35 % Parsed axioms : 2
% 0.26/0.35 % Removed by relevancy pruning/SinE : 1
% 0.26/0.35 % Initial clauses : 7
% 0.26/0.35 % Removed in clause preprocessing : 0
% 0.26/0.35 % Initial clauses in saturation : 7
% 0.26/0.35 % Processed clauses : 68
% 0.26/0.35 % ...of these trivial : 1
% 0.26/0.35 % ...subsumed : 1
% 0.26/0.35 % ...remaining for further processing : 66
% 0.26/0.35 % Other redundant clauses eliminated : 0
% 0.26/0.35 % Clauses deleted for lack of memory : 0
% 0.26/0.35 % Backward-subsumed : 0
% 0.26/0.35 % Backward-rewritten : 14
% 0.26/0.35 % Generated clauses : 125
% 0.26/0.35 % ...of the previous two non-redundant : 94
% 0.26/0.35 % ...aggressively subsumed : 0
% 0.26/0.35 % Contextual simplify-reflections : 0
% 0.26/0.35 % Paramodulations : 83
% 0.26/0.35 % Factorizations : 0
% 0.26/0.35 % NegExts : 11
% 0.26/0.35 % Equation resolutions : 4
% 0.26/0.35 % Disequality decompositions : 0
% 0.26/0.35 % Total rewrite steps : 56
% 0.26/0.35 % ...of those cached : 50
% 0.26/0.35 % Propositional unsat checks : 0
% 0.26/0.35 % Propositional check models : 0
% 0.26/0.35 % Propositional check unsatisfiable : 0
% 0.26/0.35 % Propositional clauses : 0
% 0.26/0.35 % Propositional clauses after purity: 0
% 0.26/0.35 % Propositional unsat core size : 0
% 0.26/0.35 % Propositional preprocessing time : 0.000
% 0.26/0.35 % Propositional encoding time : 0.000
% 0.26/0.35 % Propositional solver time : 0.000
% 0.26/0.35 % Success case prop preproc time : 0.000
% 0.26/0.35 % Success case prop encoding time : 0.000
% 0.26/0.35 % Success case prop solver time : 0.000
% 0.26/0.35 % Current number of processed clauses : 44
% 0.26/0.35 % Positive orientable unit clauses : 17
% 0.26/0.35 % Positive unorientable unit clauses: 0
% 0.26/0.35 % Negative unit clauses : 5
% 0.26/0.35 % Non-unit-clauses : 22
% 0.26/0.35 % Current number of unprocessed clauses: 40
% 0.26/0.35 % ...number of literals in the above : 78
% 0.26/0.35 % Current number of archived formulas : 0
% 0.26/0.35 % Current number of archived clauses : 22
% 0.26/0.35 % Clause-clause subsumption calls (NU) : 48
% 0.26/0.35 % Rec. Clause-clause subsumption calls : 43
% 0.26/0.35 % Non-unit clause-clause subsumptions : 1
% 0.26/0.35 % Unit Clause-clause subsumption calls : 2
% 0.26/0.35 % Rewrite failures with RHS unbound : 0
% 0.26/0.35 % BW rewrite match attempts : 73
% 0.26/0.35 % BW rewrite match successes : 2
% 0.26/0.35 % Condensation attempts : 0
% 0.26/0.35 % Condensation successes : 0
% 0.26/0.35 % Termbank termtop insertions : 10855
% 0.26/0.35 % Search garbage collected termcells : 315
% 0.26/0.35
% 0.26/0.35 % -------------------------------------------------
% 0.26/0.35 % User time : 0.020 s
% 0.26/0.35 % System time : 0.009 s
% 0.26/0.35 % Total time : 0.029 s
% 0.26/0.35 % Maximum resident set size: 3636 pages
% 0.26/0.35
% 0.26/0.35 % -------------------------------------------------
% 0.26/0.35 % User time : 0.084 s
% 0.26/0.35 % System time : 0.025 s
% 0.26/0.35 % Total time : 0.108 s
% 0.26/0.35 % Maximum resident set size: 4864 pages
% 0.26/0.35 % E exiting
%------------------------------------------------------------------------------