%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV059^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:48 AM UTC 2026
% Result : Theorem 0.10s 0.23s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 35 ( 6 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 137 ( 9 ~; 5 |; 12 &; 105 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 5 ^; 27 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
b: $tType ).
thf(decl_23,type,
cG: b > b ).
thf(decl_24,type,
cA: b > a ).
thf(decl_25,type,
c_less_: a > a > $o ).
thf(decl_26,type,
cF: b > b ).
thf(decl_27,type,
esk1_0: b ).
thf(cTHM89A_pme,conjecture,
( ( ! [X1: a,X2: a,X3: a] :
( ( ( c_less_ @ X1 @ X2 )
& ( c_less_ @ X2 @ X3 ) )
=> ( c_less_ @ X1 @ X3 ) )
& ! [X4: b] : ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cF @ X4 ) ) )
& ( cG
= ( ^ [X5: b] : ( cF @ ( cF @ X5 ) ) ) ) )
=> ! [X6: b] : ( c_less_ @ ( cA @ X6 ) @ ( cA @ ( cG @ X6 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.g2Yx88btNY/E---3.1_3476758.p',cTHM89A_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: a,X2: a,X3: a] :
( ( ( c_less_ @ X1 @ X2 )
& ( c_less_ @ X2 @ X3 ) )
=> ( c_less_ @ X1 @ X3 ) )
& ! [X4: b] : ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cF @ X4 ) ) )
& ( cG
= ( ^ [X5: b] : ( cF @ ( cF @ X5 ) ) ) ) )
=> ! [X6: b] : ( c_less_ @ ( cA @ X6 ) @ ( cA @ ( cG @ X6 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM89A_pme]) ).
thf(c_0_2,negated_conjecture,
~ ( ( ! [X1: a,X2: a,X3: a] :
( ( ( c_less_ @ X1 @ X2 )
& ( c_less_ @ X2 @ X3 ) )
=> ( c_less_ @ X1 @ X3 ) )
& ! [X4: b] : ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cF @ X4 ) ) )
& ( cG
= ( ^ [Z0: b] : ( cF @ ( cF @ Z0 ) ) ) ) )
=> ! [X6: b] : ( c_less_ @ ( cA @ X6 ) @ ( cA @ ( cG @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X12: a,X13: a,X14: a,X15: b] :
( ( ~ ( c_less_ @ X12 @ X13 )
| ~ ( c_less_ @ X13 @ X14 )
| ( c_less_ @ X12 @ X14 ) )
& ( c_less_ @ ( cA @ X15 ) @ ( cA @ ( cF @ X15 ) ) )
& ( cG
= ( ^ [Z0: b] : ( cF @ ( cF @ Z0 ) ) ) )
& ~ ( c_less_ @ ( cA @ esk1_0 ) @ ( cA @ ( cG @ esk1_0 ) ) ) ),
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,X2: a,X3: a] :
( ( c_less_ @ X1 @ X3 )
| ~ ( c_less_ @ X1 @ X2 )
| ~ ( c_less_ @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X4: b] : ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cF @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( cG
= ( ^ [Z0: b] : ( cF @ ( cF @ Z0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X1: a,X4: b] :
( ( c_less_ @ X1 @ ( cA @ ( cF @ X4 ) ) )
| ~ ( c_less_ @ X1 @ ( cA @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X4: b] :
( ( cF @ ( cF @ X4 ) )
= ( cG @ X4 ) ),
inference(arg_cong,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
~ ( c_less_ @ ( cA @ esk1_0 ) @ ( cA @ ( cG @ esk1_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
! [X4: b] : ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cG @ X4 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV059^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.16 % Computer : n007.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:03:55 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 Running higher-order theorem proving
% 0.10/0.21 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.g2Yx88btNY/E---3.1_3476758.p
% 0.10/0.23 % Version: 3.5.1-ho
% 0.10/0.23 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.23 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.23 % Starting post_as_ho10 with 300s (1) cores
% 0.10/0.23 % Starting new_bool_9 with 300s (1) cores
% 0.10/0.23 % Starting sh5l with 300s (1) cores
% 0.10/0.23 % ehoh_best_nonlift_nonlambdatoforall with pid 3476788 completed with status 0
% 0.10/0.23 % Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.10/0.23 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.23 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.23 % No SInE strategy applied
% 0.10/0.23 % Search class: HHUSF-FFSF11-MSSFFFNN
% 0.10/0.23 % partial match(1): HHUSF-FFSF11-SSSFFFNN
% 0.10/0.23 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.23 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.23 % Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.10/0.23 % Starting sh5l with 136s (1) cores
% 0.10/0.23 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.23 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.23 % new_bool_1 with pid 3476796 completed with status 0
% 0.10/0.23 % Result found by new_bool_1
% 0.10/0.23 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.23 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.23 % No SInE strategy applied
% 0.10/0.23 % Search class: HHUSF-FFSF11-MSSFFFNN
% 0.10/0.23 % partial match(1): HHUSF-FFSF11-SSSFFFNN
% 0.10/0.23 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.23 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.23 % Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.10/0.23 % Starting sh5l with 136s (1) cores
% 0.10/0.23 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.23 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.23 % Preprocessing time : 0.001 s
% 0.10/0.23 % Presaturation interreduction done
% 0.10/0.23
% 0.10/0.23 % Proof found!
% 0.10/0.23 % SZS status Theorem
% 0.10/0.23 % SZS output start CNFRefutation
% See solution above
% 0.10/0.23 % Parsed axioms : 7
% 0.10/0.23 % Removed by relevancy pruning/SinE : 0
% 0.10/0.23 % Initial clauses : 10
% 0.10/0.23 % Removed in clause preprocessing : 6
% 0.10/0.23 % Initial clauses in saturation : 4
% 0.10/0.23 % Processed clauses : 12
% 0.10/0.23 % ...of these trivial : 0
% 0.10/0.23 % ...subsumed : 0
% 0.10/0.23 % ...remaining for further processing : 12
% 0.10/0.23 % Other redundant clauses eliminated : 0
% 0.10/0.23 % Clauses deleted for lack of memory : 0
% 0.10/0.23 % Backward-subsumed : 0
% 0.10/0.23 % Backward-rewritten : 1
% 0.10/0.23 % Generated clauses : 9
% 0.10/0.23 % ...of the previous two non-redundant : 5
% 0.10/0.23 % ...aggressively subsumed : 0
% 0.10/0.23 % Contextual simplify-reflections : 0
% 0.10/0.23 % Paramodulations : 8
% 0.10/0.23 % Factorizations : 0
% 0.10/0.23 % NegExts : 0
% 0.10/0.23 % Equation resolutions : 0
% 0.10/0.23 % Disequality decompositions : 0
% 0.10/0.23 % Total rewrite steps : 4
% 0.10/0.23 % ...of those cached : 0
% 0.10/0.23 % Propositional unsat checks : 0
% 0.10/0.23 % Propositional check models : 0
% 0.10/0.23 % Propositional check unsatisfiable : 0
% 0.10/0.23 % Propositional clauses : 0
% 0.10/0.23 % Propositional clauses after purity: 0
% 0.10/0.23 % Propositional unsat core size : 0
% 0.10/0.23 % Propositional preprocessing time : 0.000
% 0.10/0.23 % Propositional encoding time : 0.000
% 0.10/0.23 % Propositional solver time : 0.000
% 0.10/0.23 % Success case prop preproc time : 0.000
% 0.10/0.23 % Success case prop encoding time : 0.000
% 0.10/0.23 % Success case prop solver time : 0.000
% 0.10/0.23 % Current number of processed clauses : 7
% 0.10/0.23 % Positive orientable unit clauses : 5
% 0.10/0.23 % Positive unorientable unit clauses: 0
% 0.10/0.23 % Negative unit clauses : 0
% 0.10/0.23 % Non-unit-clauses : 2
% 0.10/0.23 % Current number of unprocessed clauses: 1
% 0.10/0.23 % ...number of literals in the above : 1
% 0.10/0.23 % Current number of archived formulas : 0
% 0.10/0.23 % Current number of archived clauses : 5
% 0.10/0.23 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.23 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.23 % Non-unit clause-clause subsumptions : 0
% 0.10/0.23 % Unit Clause-clause subsumption calls : 0
% 0.10/0.23 % Rewrite failures with RHS unbound : 0
% 0.10/0.23 % BW rewrite match attempts : 1
% 0.10/0.23 % BW rewrite match successes : 1
% 0.10/0.23 % Condensation attempts : 0
% 0.10/0.23 % Condensation successes : 0
% 0.10/0.23 % Termbank termtop insertions : 647
% 0.10/0.23 % Search garbage collected termcells : 132
% 0.10/0.23
% 0.10/0.23 % -------------------------------------------------
% 0.10/0.23 % User time : 0.003 s
% 0.10/0.23 % System time : 0.001 s
% 0.10/0.23 % Total time : 0.004 s
% 0.10/0.23 % Maximum resident set size: 3888 pages
% 0.10/0.23
% 0.10/0.23 % -------------------------------------------------
% 0.10/0.23 % User time : 0.011 s
% 0.10/0.23 % System time : 0.009 s
% 0.10/0.23 % Total time : 0.020 s
% 0.10/0.23 % Maximum resident set size: 4864 pages
% 0.10/0.23 % E exiting
%------------------------------------------------------------------------------