%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV311^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 : n005.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:22 AM UTC 2026
% Result : Theorem 0.24s 0.32s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 69 ( 0 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 266 ( 15 ~; 23 |; 4 &; 179 @)
% ( 0 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 10 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 34 ( 34 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 76 ( 11 ^; 65 !; 0 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
cF: ( a > $o ) > a > $o ).
thf(decl_24,type,
esk1_2: ( a > $o ) > ( a > $o ) > a ).
thf(decl_25,type,
esk2_0: a ).
thf(decl_26,type,
epred1_0: a > $o ).
thf(decl_27,type,
esk3_2: ( a > $o ) > ( a > $o ) > a ).
thf(cTHM521_pme,conjecture,
( ! [X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
=> ! [X3: a] :
( ( cF @ X1 @ X3 )
=> ( cF @ X2 @ X3 ) ) )
=> ! [X3: a] :
( ( cF
@ ^ [X4: a] :
! [X5: a > $o] :
( ! [X6: a] :
( ( cF @ X5 @ X6 )
=> ( X5 @ X6 ) )
=> ( X5 @ X4 ) )
@ X3 )
=> ! [X5: a > $o] :
( ! [X4: a] :
( ( cF @ X5 @ X4 )
=> ( X5 @ X4 ) )
=> ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LKAGu8r7uu/E---3.1_1807982.p',cTHM521_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
=> ! [X3: a] :
( ( cF @ X1 @ X3 )
=> ( cF @ X2 @ X3 ) ) )
=> ! [X3: a] :
( ( cF
@ ^ [X4: a] :
! [X5: a > $o] :
( ! [X6: a] :
( ( cF @ X5 @ X6 )
=> ( X5 @ X6 ) )
=> ( X5 @ X4 ) )
@ X3 )
=> ! [X5: a > $o] :
( ! [X4: a] :
( ( cF @ X5 @ X4 )
=> ( X5 @ X4 ) )
=> ( X5 @ X3 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM521_pme]) ).
thf(c_0_2,negated_conjecture,
~ ( ! [X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
=> ! [X3: a] :
( ( cF @ X1 @ X3 )
=> ( cF @ X2 @ X3 ) ) )
=> ! [X3: a] :
( ( cF
@ ^ [Z0: a] :
! [X5: a > $o] :
( ! [X6: a] :
( ( cF @ X5 @ X6 )
=> ( X5 @ X6 ) )
=> ( X5 @ Z0 ) )
@ X3 )
=> ! [X5: a > $o] :
( ! [X4: a] :
( ( cF @ X5 @ X4 )
=> ( X5 @ X4 ) )
=> ( X5 @ X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X14: a > $o,X15: a > $o,X17: a,X20: a] :
( ( ( X14 @ ( esk1_2 @ X14 @ X15 ) )
| ~ ( cF @ X14 @ X17 )
| ( cF @ X15 @ X17 ) )
& ( ~ ( X15 @ ( esk1_2 @ X14 @ X15 ) )
| ~ ( cF @ X14 @ X17 )
| ( cF @ X15 @ X17 ) )
& ( cF
@ ^ [Z0: a] :
! [X5: a > $o] :
( ! [X6: a] :
( ( cF @ X5 @ X6 )
=> ( X5 @ X6 ) )
=> ( X5 @ Z0 ) )
@ esk2_0 )
& ( ~ ( cF @ epred1_0 @ X20 )
| ( epred1_0 @ X20 ) )
& ~ ( epred1_0 @ esk2_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_2])])])])])]) ).
thf(c_0_4,negated_conjecture,
! [X1: a > $o,X2: a > $o,X3: a] :
( ( X1 @ ( esk1_2 @ X1 @ X2 ) )
| ( cF @ X2 @ X3 )
| ~ ( cF @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( cF
@ ^ [Z0: a] :
! [X28: a > $o] :
( ! [X29: a] :
( ( cF @ X28 @ X29 )
=> ( X28 @ X29 ) )
=> ( X28 @ Z0 ) )
@ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X1: a > $o] :
( ! [X30: a > $o] :
( ! [X31: a] :
( ( cF @ X30 @ X31 )
=> ( X30 @ X31 ) )
=> ( X30
@ ( esk1_2
@ ^ [Z0: a] :
! [X32: a > $o] :
( ! [X33: a] :
( ( cF @ X32 @ X33 )
=> ( X32 @ X33 ) )
=> ( X32 @ Z0 ) )
@ X1 ) ) )
| ( cF @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X1: a > $o,X2: a > $o,X3: a] :
( ( cF @ X1 @ X3 )
| ~ ( X1 @ ( esk1_2 @ X2 @ X1 ) )
| ~ ( cF @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
! [X1: a > $o,X2: a > $o] :
( ( X1
@ ( esk1_2
@ ^ [Z0: a] :
! [X34: a > $o] :
( ! [X35: a] :
( ( cF @ X34 @ X35 )
=> ( X34 @ X35 ) )
=> ( X34 @ Z0 ) )
@ X2 ) )
| ( cF @ X1 @ ( esk3_2 @ X2 @ X1 ) )
| ( cF @ X2 @ esk2_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: a > $o,X3: a] :
( ( cF @ X1 @ ( esk3_2 @ X1 @ X1 ) )
| ( cF @ X1 @ esk2_0 )
| ( cF @ X1 @ X3 )
| ~ ( cF
@ ^ [Z0: a] :
! [X36: a > $o] :
( ! [X37: a] :
( ( cF @ X36 @ X37 )
=> ( X36 @ X37 ) )
=> ( X36 @ Z0 ) )
@ X3 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X3: a] :
( ( epred1_0 @ X3 )
| ~ ( cF @ epred1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,negated_conjecture,
! [X1: a > $o] :
( ( cF @ X1 @ ( esk3_2 @ X1 @ X1 ) )
| ( cF @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
thf(c_0_12,negated_conjecture,
! [X2: a > $o,X1: a > $o] :
( ( X1
@ ( esk1_2
@ ^ [Z0: a] :
! [X38: a > $o] :
( ! [X39: a] :
( ( cF @ X38 @ X39 )
=> ( X38 @ X39 ) )
=> ( X38 @ Z0 ) )
@ X2 ) )
| ( cF @ X2 @ esk2_0 )
| ~ ( X1 @ ( esk3_2 @ X2 @ X1 ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_6]) ).
thf(c_0_13,negated_conjecture,
( ( epred1_0 @ ( esk3_2 @ epred1_0 @ epred1_0 ) )
| ( cF @ epred1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
( ( epred1_0
@ ( esk1_2
@ ^ [Z0: a] :
! [X40: a > $o] :
( ! [X41: a] :
( ( cF @ X40 @ X41 )
=> ( X40 @ X41 ) )
=> ( X40 @ Z0 ) )
@ epred1_0 ) )
| ( cF @ epred1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_15,negated_conjecture,
! [X3: a] :
( ( cF @ epred1_0 @ esk2_0 )
| ( cF @ epred1_0 @ X3 )
| ~ ( cF
@ ^ [Z0: a] :
! [X42: a > $o] :
( ! [X43: a] :
( ( cF @ X42 @ X43 )
=> ( X42 @ X43 ) )
=> ( X42 @ Z0 ) )
@ X3 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
thf(c_0_16,negated_conjecture,
cF @ epred1_0 @ esk2_0,
inference(spm,[status(thm)],[c_0_15,c_0_5]) ).
thf(c_0_17,negated_conjecture,
~ ( epred1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEV311^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 % Computer : n005.cluster.edu
% 0.09/0.22 % Model : x86_64 x86_64
% 0.09/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22 % Memory : 8046.5625MB
% 0.09/0.22 % OS : Linux 6.8.0-71-generic
% 0.09/0.22 % CPULimit : 300
% 0.09/0.22 % WCLimit : 300
% 0.09/0.22 % DateTime : Tue Sep 29 15:33:31 UTC 2026
% 0.09/0.22 % CPUTime :
% 0.09/0.22 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.28 Running higher-order theorem proving
% 0.24/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.LKAGu8r7uu/E---3.1_1807982.p
% 0.24/0.32 % Version: 3.5.1-ho
% 0.24/0.32 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.32 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.32 % Starting post_as_ho12 with 300s (1) cores
% 0.24/0.32 % Starting new_bool_9 with 300s (1) cores
% 0.24/0.32 % Starting post_as_ho1 with 300s (1) cores
% 0.24/0.32 % Starting post_as_ho4 with 300s (1) cores
% 0.24/0.32 % Starting post_as_ho2 with 300s (1) cores
% 0.24/0.32 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.24/0.32 % Starting full_lambda_10 with 300s (1) cores
% 0.24/0.32 % Starting new_ho_8 with 300s (1) cores
% 0.24/0.32 % new_bool_9 with pid 1807996 completed with status 0
% 0.24/0.32 % Result found by new_bool_9
% 0.24/0.32 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.32 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.32 % Starting post_as_ho12 with 300s (1) cores
% 0.24/0.32 % Starting new_bool_9 with 300s (1) cores
% 0.24/0.32 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 0.24/0.32 % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.24/0.32 % Search class: HGUNF-FFSF22-DSSFFSBN
% 0.24/0.32 % partial match(1): HGUNF-FFSF22-SSSFFSBN
% 0.24/0.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.32 % SubtermCWHack with pid 1808003 completed with status 0
% 0.24/0.32 % Result found by SubtermCWHack
% 0.24/0.32 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.32 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.32 % Starting post_as_ho12 with 300s (1) cores
% 0.24/0.32 % Starting new_bool_9 with 300s (1) cores
% 0.24/0.32 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 0.24/0.32 % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.24/0.32 % Search class: HGUNF-FFSF22-DSSFFSBN
% 0.24/0.32 % partial match(1): HGUNF-FFSF22-SSSFFSBN
% 0.24/0.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.32 % Preprocessing time : 0.001 s
% 0.24/0.32
% 0.24/0.32 % Proof found!
% 0.24/0.32 % SZS status Theorem
% 0.24/0.32 % SZS output start CNFRefutation
% See solution above
% 0.24/0.32 % Parsed axioms : 3
% 0.24/0.32 % Removed by relevancy pruning/SinE : 2
% 0.24/0.32 % Initial clauses : 5
% 0.24/0.32 % Removed in clause preprocessing : 0
% 0.24/0.32 % Initial clauses in saturation : 5
% 0.24/0.32 % Processed clauses : 23
% 0.24/0.32 % ...of these trivial : 0
% 0.24/0.32 % ...subsumed : 0
% 0.24/0.32 % ...remaining for further processing : 23
% 0.24/0.32 % Other redundant clauses eliminated : 0
% 0.24/0.32 % Clauses deleted for lack of memory : 0
% 0.24/0.32 % Backward-subsumed : 2
% 0.24/0.32 % Backward-rewritten : 3
% 0.24/0.32 % Generated clauses : 55
% 0.24/0.32 % ...of the previous two non-redundant : 49
% 0.24/0.32 % ...aggressively subsumed : 0
% 0.24/0.32 % Contextual simplify-reflections : 0
% 0.24/0.32 % Paramodulations : 53
% 0.24/0.32 % Factorizations : 0
% 0.24/0.32 % NegExts : 0
% 0.24/0.32 % Equation resolutions : 0
% 0.24/0.32 % Disequality decompositions : 0
% 0.24/0.32 % Total rewrite steps : 4
% 0.24/0.32 % ...of those cached : 2
% 0.24/0.32 % Propositional unsat checks : 0
% 0.24/0.32 % Propositional check models : 0
% 0.24/0.32 % Propositional check unsatisfiable : 0
% 0.24/0.32 % Propositional clauses : 0
% 0.24/0.32 % Propositional clauses after purity: 0
% 0.24/0.32 % Propositional unsat core size : 0
% 0.24/0.32 % Propositional preprocessing time : 0.000
% 0.24/0.32 % Propositional encoding time : 0.000
% 0.24/0.32 % Propositional solver time : 0.000
% 0.24/0.32 % Success case prop preproc time : 0.000
% 0.24/0.32 % Success case prop encoding time : 0.000
% 0.24/0.32 % Success case prop solver time : 0.000
% 0.24/0.32 % Current number of processed clauses : 17
% 0.24/0.32 % Positive orientable unit clauses : 2
% 0.24/0.32 % Positive unorientable unit clauses: 0
% 0.24/0.32 % Negative unit clauses : 1
% 0.24/0.32 % Non-unit-clauses : 14
% 0.24/0.32 % Current number of unprocessed clauses: 30
% 0.24/0.32 % ...number of literals in the above : 141
% 0.24/0.32 % Current number of archived formulas : 0
% 0.24/0.32 % Current number of archived clauses : 6
% 0.24/0.32 % Clause-clause subsumption calls (NU) : 96
% 0.24/0.32 % Rec. Clause-clause subsumption calls : 57
% 0.24/0.32 % Non-unit clause-clause subsumptions : 2
% 0.24/0.32 % Unit Clause-clause subsumption calls : 5
% 0.24/0.32 % Rewrite failures with RHS unbound : 0
% 0.24/0.32 % BW rewrite match attempts : 1
% 0.24/0.32 % BW rewrite match successes : 1
% 0.24/0.32 % Condensation attempts : 0
% 0.24/0.32 % Condensation successes : 0
% 0.24/0.32 % Termbank termtop insertions : 5255
% 0.24/0.32 % Search garbage collected termcells : 226
% 0.24/0.32
% 0.24/0.32 % -------------------------------------------------
% 0.24/0.32 % User time : 0.007 s
% 0.24/0.32 % System time : 0.002 s
% 0.24/0.32 % Total time : 0.010 s
% 0.24/0.32 % Maximum resident set size: 3632 pages
% 0.24/0.32
% 0.24/0.32 % -------------------------------------------------
% 0.24/0.32 % User time : 0.007 s
% 0.24/0.32 % System time : 0.009 s
% 0.24/0.32 % Total time : 0.016 s
% 0.24/0.32 % Maximum resident set size: 4864 pages
% 0.24/0.32 % E exiting
%------------------------------------------------------------------------------