%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV120^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 : 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:04 AM UTC 2026
% Result : Theorem 0.21s 0.27s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 47 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 291 ( 28 ~; 35 |; 22 &; 192 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 34 ( 34 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 49 ( 0 ^; 49 !; 0 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
epred1_0: ( a > a > $o ) > $o ).
thf(decl_24,type,
esk1_0: a ).
thf(decl_25,type,
esk2_0: a ).
thf(decl_26,type,
esk3_0: a ).
thf(decl_27,type,
esk4_1: ( a > a > $o ) > a ).
thf(decl_28,type,
esk5_1: ( a > a > $o ) > a ).
thf(decl_29,type,
esk6_1: ( a > a > $o ) > a ).
thf(decl_30,type,
esk7_1: ( a > a > $o ) > a ).
thf(decl_31,type,
esk8_1: ( a > a > $o ) > a ).
thf(decl_32,type,
esk9_1: ( a > a > $o ) > a ).
thf(decl_33,type,
epred2_0: a > a > $o ).
thf(cTHM70_pme,conjecture,
! [X1: ( a > a > $o ) > $o,X2: a,X3: a,X4: a] :
( ( ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) )
& ( X1 @ X5 ) )
=> ( X5 @ X2 @ X3 ) )
& ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) )
& ( X1 @ X5 ) )
=> ( X5 @ X3 @ X4 ) ) )
=> ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) )
& ( X1 @ X5 ) )
=> ( X5 @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.1Hp3ghGOs2/E---3.1_1172897.p',cTHM70_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( a > a > $o ) > $o,X2: a,X3: a,X4: a] :
( ( ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) )
& ( X1 @ X5 ) )
=> ( X5 @ X2 @ X3 ) )
& ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) )
& ( X1 @ X5 ) )
=> ( X5 @ X3 @ X4 ) ) )
=> ! [X5: a > a > $o] :
( ( ! [X6: a,X7: a,X8: a] :
( ( ( X5 @ X6 @ X7 )
& ( X5 @ X7 @ X8 ) )
=> ( X5 @ X6 @ X8 ) )
& ( X1 @ X5 ) )
=> ( X5 @ X2 @ X4 ) ) ),
inference(assume_negation,[status(cth)],[cTHM70_pme]) ).
thf(c_0_2,negated_conjecture,
! [X29: a > a > $o,X33: a > a > $o,X38: a,X39: a,X40: a] :
( ( ( X29 @ ( esk4_1 @ X29 ) @ ( esk5_1 @ X29 ) )
| ~ ( epred1_0 @ X29 )
| ( X29 @ esk1_0 @ esk2_0 ) )
& ( ( X29 @ ( esk5_1 @ X29 ) @ ( esk6_1 @ X29 ) )
| ~ ( epred1_0 @ X29 )
| ( X29 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X29 @ ( esk4_1 @ X29 ) @ ( esk6_1 @ X29 ) )
| ~ ( epred1_0 @ X29 )
| ( X29 @ esk1_0 @ esk2_0 ) )
& ( ( X33 @ ( esk7_1 @ X33 ) @ ( esk8_1 @ X33 ) )
| ~ ( epred1_0 @ X33 )
| ( X33 @ esk2_0 @ esk3_0 ) )
& ( ( X33 @ ( esk8_1 @ X33 ) @ ( esk9_1 @ X33 ) )
| ~ ( epred1_0 @ X33 )
| ( X33 @ esk2_0 @ esk3_0 ) )
& ( ~ ( X33 @ ( esk7_1 @ X33 ) @ ( esk9_1 @ X33 ) )
| ~ ( epred1_0 @ X33 )
| ( X33 @ esk2_0 @ esk3_0 ) )
& ( ~ ( epred2_0 @ X38 @ X39 )
| ~ ( epred2_0 @ X39 @ X40 )
| ( epred2_0 @ X38 @ X40 ) )
& ( epred1_0 @ epred2_0 )
& ~ ( epred2_0 @ esk1_0 @ esk3_0 ) ),
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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X2: a,X3: a,X4: a] :
( ( epred2_0 @ X2 @ X4 )
| ~ ( epred2_0 @ X2 @ X3 )
| ~ ( epred2_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X5: a > a > $o] :
( ( X5 @ ( esk8_1 @ X5 ) @ ( esk9_1 @ X5 ) )
| ( X5 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
epred1_0 @ epred2_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X5: a > a > $o] :
( ( X5 @ esk2_0 @ esk3_0 )
| ~ ( X5 @ ( esk7_1 @ X5 ) @ ( esk9_1 @ X5 ) )
| ~ ( epred1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X2: a] :
( ( epred2_0 @ X2 @ ( esk9_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 @ esk3_0 )
| ~ ( epred2_0 @ X2 @ ( esk8_1 @ epred2_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]) ).
thf(c_0_8,negated_conjecture,
! [X5: a > a > $o] :
( ( X5 @ ( esk5_1 @ X5 ) @ ( esk6_1 @ X5 ) )
| ( X5 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
( ( epred2_0 @ esk2_0 @ esk3_0 )
| ~ ( epred2_0 @ ( esk7_1 @ epred2_0 ) @ ( esk8_1 @ epred2_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_5])]) ).
thf(c_0_10,negated_conjecture,
! [X5: a > a > $o] :
( ( X5 @ ( esk7_1 @ X5 ) @ ( esk8_1 @ X5 ) )
| ( X5 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X5: a > a > $o] :
( ( X5 @ esk1_0 @ esk2_0 )
| ~ ( X5 @ ( esk4_1 @ X5 ) @ ( esk6_1 @ X5 ) )
| ~ ( epred1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X2: a] :
( ( epred2_0 @ X2 @ ( esk6_1 @ epred2_0 ) )
| ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ X2 @ ( esk5_1 @ epred2_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_8]),c_0_5])]) ).
thf(c_0_13,negated_conjecture,
epred2_0 @ esk2_0 @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_5])]) ).
thf(c_0_14,negated_conjecture,
( ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ ( esk4_1 @ epred2_0 ) @ ( esk5_1 @ epred2_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_5])]) ).
thf(c_0_15,negated_conjecture,
! [X5: a > a > $o] :
( ( X5 @ ( esk4_1 @ X5 ) @ ( esk5_1 @ X5 ) )
| ( X5 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_16,negated_conjecture,
~ ( epred2_0 @ esk1_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_17,negated_conjecture,
! [X2: a] :
( ( epred2_0 @ X2 @ esk3_0 )
| ~ ( epred2_0 @ X2 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_13]) ).
thf(c_0_18,negated_conjecture,
epred2_0 @ esk1_0 @ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_5])]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV120^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.07/0.19 % Computer : n020.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 15:12:49 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.24 Running higher-order theorem proving
% 0.07/0.25 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.1Hp3ghGOs2/E---3.1_1172897.p
% 0.21/0.27 % Version: 3.5.1-ho
% 0.21/0.27 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.21/0.27 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting sh2lt with 1200s (4) cores
% 0.21/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.21/0.27 % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.27 % Starting post_as_ho1 with 300s (1) cores
% 0.21/0.27 % Starting ehoh_best3_rw with 300s (1) cores
% 0.21/0.27 % new_ho_10_unif with pid 1172911 completed with status 0
% 0.21/0.27 % Result found by new_ho_10_unif
% 0.21/0.27 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.21/0.27 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting sh2lt with 1200s (4) cores
% 0.21/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.21/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.27 % No SInE strategy applied
% 0.21/0.27 % Search class: HGUNF-FFSF11-SHHFFMBN
% 0.21/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.27 % SubtermCWHack with pid 1172917 completed with status 0
% 0.21/0.27 % Result found by SubtermCWHack
% 0.21/0.27 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.21/0.27 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting sh2lt with 1200s (4) cores
% 0.21/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.21/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.27 % No SInE strategy applied
% 0.21/0.27 % Search class: HGUNF-FFSF11-SHHFFMBN
% 0.21/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.27 % Preprocessing time : 0.001 s
% 0.21/0.27
% 0.21/0.27 % Proof found!
% 0.21/0.27 % SZS status Theorem
% 0.21/0.27 % SZS output start CNFRefutation
% See solution above
% 0.21/0.27 % Parsed axioms : 2
% 0.21/0.27 % Removed by relevancy pruning/SinE : 0
% 0.21/0.27 % Initial clauses : 10
% 0.21/0.27 % Removed in clause preprocessing : 1
% 0.21/0.27 % Initial clauses in saturation : 9
% 0.21/0.27 % Processed clauses : 19
% 0.21/0.27 % ...of these trivial : 0
% 0.21/0.27 % ...subsumed : 0
% 0.21/0.27 % ...remaining for further processing : 19
% 0.21/0.27 % Other redundant clauses eliminated : 0
% 0.21/0.27 % Clauses deleted for lack of memory : 0
% 0.21/0.27 % Backward-subsumed : 0
% 0.21/0.27 % Backward-rewritten : 6
% 0.21/0.27 % Generated clauses : 18
% 0.21/0.27 % ...of the previous two non-redundant : 16
% 0.21/0.27 % ...aggressively subsumed : 0
% 0.21/0.27 % Contextual simplify-reflections : 0
% 0.21/0.27 % Paramodulations : 18
% 0.21/0.27 % Factorizations : 0
% 0.21/0.27 % NegExts : 0
% 0.21/0.27 % Equation resolutions : 0
% 0.21/0.27 % Disequality decompositions : 0
% 0.21/0.27 % Total rewrite steps : 15
% 0.21/0.27 % ...of those cached : 12
% 0.21/0.27 % Propositional unsat checks : 0
% 0.21/0.27 % Propositional check models : 0
% 0.21/0.27 % Propositional check unsatisfiable : 0
% 0.21/0.27 % Propositional clauses : 0
% 0.21/0.27 % Propositional clauses after purity: 0
% 0.21/0.27 % Propositional unsat core size : 0
% 0.21/0.27 % Propositional preprocessing time : 0.000
% 0.21/0.27 % Propositional encoding time : 0.000
% 0.21/0.27 % Propositional solver time : 0.000
% 0.21/0.27 % Success case prop preproc time : 0.000
% 0.21/0.27 % Success case prop encoding time : 0.000
% 0.21/0.27 % Success case prop solver time : 0.000
% 0.21/0.27 % Current number of processed clauses : 13
% 0.21/0.27 % Positive orientable unit clauses : 3
% 0.21/0.27 % Positive unorientable unit clauses: 0
% 0.21/0.27 % Negative unit clauses : 1
% 0.21/0.27 % Non-unit-clauses : 9
% 0.21/0.27 % Current number of unprocessed clauses: 5
% 0.21/0.27 % ...number of literals in the above : 18
% 0.21/0.27 % Current number of archived formulas : 0
% 0.21/0.27 % Current number of archived clauses : 6
% 0.21/0.27 % Clause-clause subsumption calls (NU) : 13
% 0.21/0.27 % Rec. Clause-clause subsumption calls : 13
% 0.21/0.27 % Non-unit clause-clause subsumptions : 0
% 0.21/0.27 % Unit Clause-clause subsumption calls : 0
% 0.21/0.27 % Rewrite failures with RHS unbound : 0
% 0.21/0.27 % BW rewrite match attempts : 2
% 0.21/0.27 % BW rewrite match successes : 2
% 0.21/0.27 % Condensation attempts : 0
% 0.21/0.27 % Condensation successes : 0
% 0.21/0.27 % Termbank termtop insertions : 1538
% 0.21/0.27 % Search garbage collected termcells : 346
% 0.21/0.27
% 0.21/0.27 % -------------------------------------------------
% 0.21/0.27 % User time : 0.005 s
% 0.21/0.27 % System time : 0.002 s
% 0.21/0.27 % Total time : 0.007 s
% 0.21/0.27 % Maximum resident set size: 3636 pages
% 0.21/0.27
% 0.21/0.27 % -------------------------------------------------
% 0.21/0.27 % User time : 0.007 s
% 0.21/0.27 % System time : 0.006 s
% 0.21/0.27 % Total time : 0.013 s
% 0.21/0.27 % Maximum resident set size: 4864 pages
% 0.21/0.27 % E exiting
%------------------------------------------------------------------------------