%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV104^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 : n017.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.10s 0.24s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 97 ( 0 equ; 0 cnn)
% Maximal formula atoms : 20 ( 6 avg)
% Number of connectives : 300 ( 26 ~; 27 |; 36 &; 193 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 74 ( 0 ^; 71 !; 3 ?; 74 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
b: $tType ).
thf(decl_23,type,
cR: a > a > $o ).
thf(decl_24,type,
z: a ).
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_0: a ).
thf(decl_30,type,
esk4_0: a ).
thf(cTHM552D_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,X8: a,X9: a] :
( ( ! [X3: a] :
( ( f @ X8 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X8 @ z ) ) )
& ! [X3: a] :
( ( f @ X9 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X9 @ z ) ) ) )
=> ( cR @ X8 @ X9 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.24XzbKPslQ/E---3.1_444046.p',cTHM552D_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,X8: a,X9: a] :
( ( ! [X3: a] :
( ( f @ X8 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X8 @ z ) ) )
& ! [X3: a] :
( ( f @ X9 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X9 @ z ) ) ) )
=> ( cR @ X8 @ X9 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM552D_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,X8: a,X9: a] :
( ( ! [X3: a] :
( ( f @ X8 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X8 @ z ) ) )
& ! [X3: a] :
( ( f @ X9 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X9 @ z ) ) ) )
=> ( cR @ X8 @ X9 ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X27: a,X28: a,X29: a,X30: a,X31: a,X33: a,X34: b,X35: b,X36: a,X37: a,X38: b,X42: a,X43: a] :
( ( ~ ( cR @ X27 @ X28 )
| ~ ( cR @ X29 @ X28 )
| ( cR @ X27 @ X29 ) )
& ( cR @ X30 @ X30 )
& ( f @ X31 @ ( esk1_1 @ X31 ) )
& ( ~ ( f @ X33 @ X34 )
| ~ ( f @ X33 @ X35 )
| ( cS @ X34 @ X35 ) )
& ( ~ ( f @ X36 @ X38 )
| ~ ( f @ X37 @ X38 )
| ( cR @ X36 @ X37 ) )
& ( ~ ( f @ X42 @ esk2_0 )
| ( f @ esk3_0 @ esk2_0 ) )
& ( ( cR @ esk3_0 @ z )
| ( f @ esk3_0 @ esk2_0 ) )
& ( ~ ( f @ X43 @ esk2_0 )
| ( f @ esk4_0 @ esk2_0 ) )
& ( ( cR @ esk4_0 @ z )
| ( f @ esk4_0 @ esk2_0 ) )
& ~ ( cR @ esk3_0 @ esk4_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,X3: a,X2: a] :
( ( cR @ X1 @ X3 )
| ~ ( cR @ X1 @ X2 )
| ~ ( cR @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( cR @ esk4_0 @ z )
| ( f @ esk4_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X1: a] :
( ( f @ esk4_0 @ esk2_0 )
| ( cR @ X1 @ esk4_0 )
| ~ ( cR @ X1 @ z ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,negated_conjecture,
( ( cR @ esk3_0 @ z )
| ( f @ esk3_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
~ ( cR @ esk3_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
! [X1: a] :
( ( f @ esk4_0 @ esk2_0 )
| ~ ( f @ X1 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
! [X1: a,X2: a,X5: b] :
( ( cR @ X1 @ X2 )
| ~ ( f @ X1 @ X5 )
| ~ ( f @ X2 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,negated_conjecture,
f @ esk4_0 @ esk2_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X1: a] :
( ( f @ esk3_0 @ esk2_0 )
| ~ ( f @ X1 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_13,negated_conjecture,
! [X1: a] :
( ( cR @ X1 @ esk4_0 )
| ~ ( f @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
f @ esk3_0 @ esk2_0,
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV104^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.10/0.16 % Computer : n017.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 15:06:07 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running higher-order theorem proving
% 0.10/0.22 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.24XzbKPslQ/E---3.1_444046.p
% 0.10/0.24 % Version: 3.5.1-ho
% 0.10/0.24 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.10/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.24 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.24 % Starting full_lambda_5 with 300s (1) cores
% 0.10/0.24 % Starting new_ho_10_unif with 300s (1) cores
% 0.10/0.24 % new_ho_10_unif with pid 444062 completed with status 0
% 0.10/0.24 % Result found by new_ho_10_unif
% 0.10/0.24 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.10/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.24 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.24 % Starting full_lambda_5 with 300s (1) cores
% 0.10/0.24 % Starting new_ho_10_unif with 300s (1) cores
% 0.10/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.24 % No SInE strategy applied
% 0.10/0.24 % Search class: HGUNS-FFSF11-SFFFFFNN
% 0.10/0.24 % partial match(1): HGUNF-FFSF11-SFFFFFNN
% 0.10/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.24 % SubtermCWHack with pid 444067 completed with status 0
% 0.10/0.24 % Result found by SubtermCWHack
% 0.10/0.24 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.10/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.24 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.24 % Starting full_lambda_5 with 300s (1) cores
% 0.10/0.24 % Starting new_ho_10_unif with 300s (1) cores
% 0.10/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.24 % No SInE strategy applied
% 0.10/0.24 % Search class: HGUNS-FFSF11-SFFFFFNN
% 0.10/0.24 % partial match(1): HGUNF-FFSF11-SFFFFFNN
% 0.10/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.24 % Preprocessing time : 0.001 s
% 0.10/0.24
% 0.10/0.24 % Proof found!
% 0.10/0.24 % SZS status Theorem
% 0.10/0.24 % SZS output start CNFRefutation
% See solution above
% 0.10/0.24 % Parsed axioms : 7
% 0.10/0.24 % Removed by relevancy pruning/SinE : 0
% 0.10/0.24 % Initial clauses : 16
% 0.10/0.24 % Removed in clause preprocessing : 6
% 0.10/0.24 % Initial clauses in saturation : 10
% 0.10/0.24 % Processed clauses : 16
% 0.10/0.24 % ...of these trivial : 0
% 0.10/0.24 % ...subsumed : 0
% 0.10/0.24 % ...remaining for further processing : 16
% 0.10/0.24 % Other redundant clauses eliminated : 0
% 0.10/0.24 % Clauses deleted for lack of memory : 0
% 0.10/0.24 % Backward-subsumed : 0
% 0.10/0.24 % Backward-rewritten : 5
% 0.10/0.24 % Generated clauses : 16
% 0.10/0.24 % ...of the previous two non-redundant : 11
% 0.10/0.24 % ...aggressively subsumed : 0
% 0.10/0.24 % Contextual simplify-reflections : 1
% 0.10/0.24 % Paramodulations : 16
% 0.10/0.24 % Factorizations : 0
% 0.10/0.24 % NegExts : 0
% 0.10/0.24 % Equation resolutions : 0
% 0.10/0.24 % Disequality decompositions : 0
% 0.10/0.24 % Total rewrite steps : 8
% 0.10/0.24 % ...of those cached : 4
% 0.10/0.24 % Propositional unsat checks : 0
% 0.10/0.24 % Propositional check models : 0
% 0.10/0.24 % Propositional check unsatisfiable : 0
% 0.10/0.24 % Propositional clauses : 0
% 0.10/0.24 % Propositional clauses after purity: 0
% 0.10/0.24 % Propositional unsat core size : 0
% 0.10/0.24 % Propositional preprocessing time : 0.000
% 0.10/0.24 % Propositional encoding time : 0.000
% 0.10/0.24 % Propositional solver time : 0.000
% 0.10/0.24 % Success case prop preproc time : 0.000
% 0.10/0.24 % Success case prop encoding time : 0.000
% 0.10/0.24 % Success case prop solver time : 0.000
% 0.10/0.24 % Current number of processed clauses : 11
% 0.10/0.24 % Positive orientable unit clauses : 4
% 0.10/0.24 % Positive unorientable unit clauses: 0
% 0.10/0.24 % Negative unit clauses : 1
% 0.10/0.24 % Non-unit-clauses : 6
% 0.10/0.24 % Current number of unprocessed clauses: 4
% 0.10/0.24 % ...number of literals in the above : 9
% 0.10/0.24 % Current number of archived formulas : 0
% 0.10/0.24 % Current number of archived clauses : 5
% 0.10/0.24 % Clause-clause subsumption calls (NU) : 5
% 0.10/0.24 % Rec. Clause-clause subsumption calls : 4
% 0.10/0.24 % Non-unit clause-clause subsumptions : 1
% 0.10/0.24 % Unit Clause-clause subsumption calls : 0
% 0.10/0.24 % Rewrite failures with RHS unbound : 0
% 0.10/0.24 % BW rewrite match attempts : 2
% 0.10/0.24 % BW rewrite match successes : 2
% 0.10/0.24 % Condensation attempts : 0
% 0.10/0.24 % Condensation successes : 0
% 0.10/0.24 % Termbank termtop insertions : 1347
% 0.10/0.24 % Search garbage collected termcells : 426
% 0.10/0.24
% 0.10/0.24 % -------------------------------------------------
% 0.10/0.24 % User time : 0.004 s
% 0.10/0.24 % System time : 0.003 s
% 0.10/0.24 % Total time : 0.007 s
% 0.10/0.24 % Maximum resident set size: 3640 pages
% 0.10/0.24
% 0.10/0.24 % -------------------------------------------------
% 0.10/0.24 % User time : 0.006 s
% 0.10/0.24 % System time : 0.006 s
% 0.10/0.24 % Total time : 0.013 s
% 0.10/0.24 % Maximum resident set size: 4864 pages
% 0.10/0.24 % E exiting
%------------------------------------------------------------------------------