%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV096^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 : n016.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:34:52 AM UTC 2026
% Result : Theorem 0.08s 0.26s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 62 ( 0 equ; 0 cnn)
% Maximal formula atoms : 14 ( 6 avg)
% Number of connectives : 194 ( 16 ~; 11 |; 27 &; 125 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 9 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 61 ( 0 ^; 55 !; 6 ?; 61 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
b: $tType ).
thf(decl_23,type,
z: a ).
thf(decl_24,type,
cR: a > a > $o ).
thf(decl_25,type,
f: a > b > $o ).
thf(decl_26,type,
cS: b > b > $o ).
thf(decl_27,type,
esk1_1: a > b ).
thf(decl_28,type,
esk2_0: b ).
thf(decl_29,type,
esk3_1: a > a ).
thf(cTHM552E_pme,conjecture,
( ( ! [X1: a,X2: a,X3: a] :
( ( ( cR @ X1 @ X2 )
& ( cR @ X3 @ X2 ) )
=> ( cR @ X1 @ X3 ) )
& ! [X4: a] : ( cR @ X4 @ X4 ) )
=> ( ( ! [X4: a] :
? [X5: b] : ( f @ X4 @ X5 )
& ! [X4: a,X6: b,X7: b] :
( ( ( f @ X4 @ X6 )
& ( f @ X4 @ X7 ) )
=> ( cS @ X6 @ X7 ) )
& ! [X8: a,X9: a,X5: b] :
( ( ( f @ X8 @ X5 )
& ( f @ X9 @ X5 ) )
=> ( cR @ X8 @ X9 ) ) )
=> ! [X5: b] :
? [X4: a] :
! [X3: a] :
( ( f @ X4 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X4 @ z ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.IZJZSMafLx/E---3.1_469581.p',cTHM552E_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: a,X2: a,X3: a] :
( ( ( cR @ X1 @ X2 )
& ( cR @ X3 @ X2 ) )
=> ( cR @ X1 @ X3 ) )
& ! [X4: a] : ( cR @ X4 @ X4 ) )
=> ( ( ! [X4: a] :
? [X5: b] : ( f @ X4 @ X5 )
& ! [X4: a,X6: b,X7: b] :
( ( ( f @ X4 @ X6 )
& ( f @ X4 @ X7 ) )
=> ( cS @ X6 @ X7 ) )
& ! [X8: a,X9: a,X5: b] :
( ( ( f @ X8 @ X5 )
& ( f @ X9 @ X5 ) )
=> ( cR @ X8 @ X9 ) ) )
=> ! [X5: b] :
? [X4: a] :
! [X3: a] :
( ( f @ X4 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X4 @ z ) ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM552E_pme]) ).
thf(c_0_2,negated_conjecture,
~ ( ( ! [X1: a,X2: a,X3: a] :
( ( ( cR @ X1 @ X2 )
& ( cR @ X3 @ X2 ) )
=> ( cR @ X1 @ X3 ) )
& ! [X4: a] : ( cR @ X4 @ X4 ) )
=> ( ( ! [X4: a] :
? [X5: b] : ( f @ X4 @ X5 )
& ! [X4: a,X6: b,X7: b] :
( ( ( f @ X4 @ X6 )
& ( f @ X4 @ X7 ) )
=> ( cS @ X6 @ X7 ) )
& ! [X8: a,X9: a,X5: b] :
( ( ( f @ X8 @ X5 )
& ( f @ X9 @ X5 ) )
=> ( cR @ X8 @ X9 ) ) )
=> ! [X5: b] :
? [X4: a] :
! [X3: a] :
( ( f @ X4 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X4 @ z ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X25: a,X26: a,X27: a,X28: a,X29: a,X31: a,X32: b,X33: b,X34: a,X35: a,X36: b,X38: a] :
( ( ~ ( cR @ X25 @ X26 )
| ~ ( cR @ X27 @ X26 )
| ( cR @ X25 @ X27 ) )
& ( cR @ X28 @ X28 )
& ( f @ X29 @ ( esk1_1 @ X29 ) )
& ( ~ ( f @ X31 @ X32 )
| ~ ( f @ X31 @ X33 )
| ( cS @ X32 @ X33 ) )
& ( ~ ( f @ X34 @ X36 )
| ~ ( f @ X35 @ X36 )
| ( cR @ X34 @ X35 ) )
& ~ ( f @ X38 @ esk2_0 )
& ( ( f @ ( esk3_1 @ X38 ) @ esk2_0 )
| ~ ( cR @ X38 @ z ) ) ),
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] :
( ( f @ ( esk3_1 @ X1 ) @ esk2_0 )
| ~ ( cR @ X1 @ z ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X1: a] :
~ ( f @ X1 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X1: a] :
~ ( cR @ X1 @ z ),
inference(sr,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X1: a] : ( cR @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_6,c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV096^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.08/0.18 % Computer : n016.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 15:15:04 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.24 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.IZJZSMafLx/E---3.1_469581.p
% 0.08/0.26 % Version: 3.5.1-ho
% 0.08/0.26 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.26 % Starting full_lambda_5 with 300s (1) cores
% 0.08/0.26 % Starting new_ho_10_unif with 300s (1) cores
% 0.08/0.26 % new_bool_1 with pid 469595 completed with status 0
% 0.08/0.26 % Result found by new_bool_1
% 0.08/0.26 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.26 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.26 % Search class: HHUNS-FFSF11-SFFFFFNN
% 0.08/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.26 % SubtermCWHack with pid 469601 completed with status 0
% 0.08/0.26 % Result found by SubtermCWHack
% 0.08/0.26 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.26 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.26 % Search class: HHUNS-FFSF11-SFFFFFNN
% 0.08/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.26 % Preprocessing time : 0.001 s
% 0.08/0.26
% 0.08/0.26 % Proof found!
% 0.08/0.26 % SZS status Theorem
% 0.08/0.26 % SZS output start CNFRefutation
% See solution above
% 0.08/0.26 % Parsed axioms : 7
% 0.08/0.26 % Removed by relevancy pruning/SinE : 6
% 0.08/0.26 % Initial clauses : 7
% 0.08/0.26 % Removed in clause preprocessing : 0
% 0.08/0.26 % Initial clauses in saturation : 7
% 0.08/0.26 % Processed clauses : 4
% 0.08/0.26 % ...of these trivial : 0
% 0.08/0.26 % ...subsumed : 0
% 0.08/0.26 % ...remaining for further processing : 4
% 0.08/0.26 % Other redundant clauses eliminated : 0
% 0.08/0.26 % Clauses deleted for lack of memory : 0
% 0.08/0.26 % Backward-subsumed : 0
% 0.08/0.26 % Backward-rewritten : 0
% 0.08/0.26 % Generated clauses : 1
% 0.08/0.26 % ...of the previous two non-redundant : 0
% 0.08/0.26 % ...aggressively subsumed : 0
% 0.08/0.26 % Contextual simplify-reflections : 0
% 0.08/0.26 % Paramodulations : 1
% 0.08/0.26 % Factorizations : 0
% 0.08/0.26 % NegExts : 0
% 0.08/0.26 % Equation resolutions : 0
% 0.08/0.26 % Disequality decompositions : 0
% 0.08/0.26 % Total rewrite steps : 0
% 0.08/0.26 % ...of those cached : 0
% 0.08/0.26 % Propositional unsat checks : 0
% 0.08/0.26 % Propositional check models : 0
% 0.08/0.26 % Propositional check unsatisfiable : 0
% 0.08/0.26 % Propositional clauses : 0
% 0.08/0.26 % Propositional clauses after purity: 0
% 0.08/0.26 % Propositional unsat core size : 0
% 0.08/0.26 % Propositional preprocessing time : 0.000
% 0.08/0.26 % Propositional encoding time : 0.000
% 0.08/0.26 % Propositional solver time : 0.000
% 0.08/0.26 % Success case prop preproc time : 0.000
% 0.08/0.26 % Success case prop encoding time : 0.000
% 0.08/0.26 % Success case prop solver time : 0.000
% 0.08/0.26 % Current number of processed clauses : 4
% 0.08/0.26 % Positive orientable unit clauses : 2
% 0.08/0.26 % Positive unorientable unit clauses: 0
% 0.08/0.26 % Negative unit clauses : 2
% 0.08/0.26 % Non-unit-clauses : 0
% 0.08/0.26 % Current number of unprocessed clauses: 3
% 0.08/0.26 % ...number of literals in the above : 9
% 0.08/0.26 % Current number of archived formulas : 0
% 0.08/0.26 % Current number of archived clauses : 0
% 0.08/0.26 % Clause-clause subsumption calls (NU) : 0
% 0.08/0.26 % Rec. Clause-clause subsumption calls : 0
% 0.08/0.26 % Non-unit clause-clause subsumptions : 0
% 0.08/0.26 % Unit Clause-clause subsumption calls : 0
% 0.08/0.26 % Rewrite failures with RHS unbound : 0
% 0.08/0.26 % BW rewrite match attempts : 0
% 0.08/0.26 % BW rewrite match successes : 0
% 0.08/0.26 % Condensation attempts : 0
% 0.08/0.26 % Condensation successes : 0
% 0.08/0.26 % Termbank termtop insertions : 806
% 0.08/0.26 % Search garbage collected termcells : 336
% 0.08/0.26
% 0.08/0.26 % -------------------------------------------------
% 0.08/0.26 % User time : 0.005 s
% 0.08/0.26 % System time : 0.000 s
% 0.08/0.26 % Total time : 0.005 s
% 0.08/0.26 % Maximum resident set size: 3640 pages
% 0.08/0.26
% 0.08/0.26 % -------------------------------------------------
% 0.08/0.26 % User time : 0.007 s
% 0.08/0.26 % System time : 0.003 s
% 0.08/0.26 % Total time : 0.011 s
% 0.08/0.26 % Maximum resident set size: 4608 pages
% 0.08/0.26 % E exiting
%------------------------------------------------------------------------------