%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV385^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 : n013.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:27 AM UTC 2026
% Result : Theorem 0.24s 0.28s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 58 ( 57 equ; 0 cnn)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 145 ( 18 ~; 23 |; 13 &; 84 @)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Number of types : 2 ( 2 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 10 ^; 15 !; 6 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_23,type,
x: b ).
thf(decl_24,type,
y: a ).
thf(decl_25,type,
esk1_1: ( b > a ) > b ).
thf(decl_26,type,
esk2_1: ( b > a ) > a ).
thf(decl_27,type,
esk3_2: ( b > a ) > b > b ).
thf(cX6004_pme,conjecture,
? [X1: b > a] :
( ! [X2: b] :
( ( x = X2 )
=> ( y
= ( X1 @ X2 ) ) )
& ! [X3: a] :
( ( y = X3 )
=> ? [X4: b] :
( ( ^ [X5: b] :
( ( x = X5 )
& ( X3
= ( X1 @ X5 ) ) ) )
= ( ^ [X6: b,X7: b] : ( X6 = X7 )
@ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9cNFbwLFF6/E---3.1_2273291.p',cX6004_pme) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: b > a] :
( ! [X2: b] :
( ( x = X2 )
=> ( y
= ( X1 @ X2 ) ) )
& ! [X3: a] :
( ( y = X3 )
=> ? [X4: b] :
( ( ^ [X5: b] :
( ( x = X5 )
& ( X3
= ( X1 @ X5 ) ) ) )
= ( ^ [X6: b,X7: b] : ( X6 = X7 )
@ X4 ) ) ) ),
inference(assume_negation,[status(cth)],[cX6004_pme]) ).
thf(c_0_2,negated_conjecture,
~ ? [X1: b > a] :
( ! [X2: b] :
( ( x = X2 )
=> ( y
= ( X1 @ X2 ) ) )
& ! [X3: a] :
( ( y = X3 )
=> ? [X4: b] :
! [X12: b] :
( ( ( x = X12 )
& ( X3
= ( X1 @ X12 ) ) )
<=> ( X4 = X12 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
! [X13: b > a,X16: b] :
( ( ( y
= ( esk2_1 @ X13 ) )
| ( x
= ( esk1_1 @ X13 ) ) )
& ( ( x
!= ( esk3_2 @ X13 @ X16 ) )
| ( ( esk2_1 @ X13 )
!= ( X13 @ ( esk3_2 @ X13 @ X16 ) ) )
| ( X16
!= ( esk3_2 @ X13 @ X16 ) )
| ( x
= ( esk1_1 @ X13 ) ) )
& ( ( x
= ( esk3_2 @ X13 @ X16 ) )
| ( X16
= ( esk3_2 @ X13 @ X16 ) )
| ( x
= ( esk1_1 @ X13 ) ) )
& ( ( ( esk2_1 @ X13 )
= ( X13 @ ( esk3_2 @ X13 @ X16 ) ) )
| ( X16
= ( esk3_2 @ X13 @ X16 ) )
| ( x
= ( esk1_1 @ X13 ) ) )
& ( ( y
= ( esk2_1 @ X13 ) )
| ( y
!= ( X13 @ ( esk1_1 @ X13 ) ) ) )
& ( ( x
!= ( esk3_2 @ X13 @ X16 ) )
| ( ( esk2_1 @ X13 )
!= ( X13 @ ( esk3_2 @ X13 @ X16 ) ) )
| ( X16
!= ( esk3_2 @ X13 @ X16 ) )
| ( y
!= ( X13 @ ( esk1_1 @ X13 ) ) ) )
& ( ( x
= ( esk3_2 @ X13 @ X16 ) )
| ( X16
= ( esk3_2 @ X13 @ X16 ) )
| ( y
!= ( X13 @ ( esk1_1 @ X13 ) ) ) )
& ( ( ( esk2_1 @ X13 )
= ( X13 @ ( esk3_2 @ X13 @ X16 ) ) )
| ( X16
= ( esk3_2 @ X13 @ X16 ) )
| ( y
!= ( X13 @ ( esk1_1 @ X13 ) ) ) ) ),
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,
! [X2: b,X1: b > a] :
( ( x
= ( esk3_2 @ X1 @ X2 ) )
| ( X2
= ( esk3_2 @ X1 @ X2 ) )
| ( y
!= ( X1 @ ( esk1_1 @ X1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X2: b] :
( ( ( esk3_2
@ ^ [Z0: b] : y
@ X2 )
= x )
| ( ( esk3_2
@ ^ [Z0: b] : y
@ X2 )
= X2 ) ),
inference(er,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: b > a] :
( ( y
= ( esk2_1 @ X1 ) )
| ( y
!= ( X1 @ ( esk1_1 @ X1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X2: b,X1: b > a] :
( ( x
!= ( esk3_2 @ X1 @ X2 ) )
| ( ( esk2_1 @ X1 )
!= ( X1 @ ( esk3_2 @ X1 @ X2 ) ) )
| ( X2
!= ( esk3_2 @ X1 @ X2 ) )
| ( y
!= ( X1 @ ( esk1_1 @ X1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
( ( esk3_2
@ ^ [Z0: b] : y
@ x )
= x ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_5])]) ).
thf(c_0_9,negated_conjecture,
( ( esk2_1
@ ^ [Z0: b] : y )
= y ),
inference(er,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV385^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n013.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 15:42:51 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.09/0.25 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.9cNFbwLFF6/E---3.1_2273291.p
% 0.24/0.28 % Version: 3.5.1-ho
% 0.24/0.28 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.28 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.28 % Starting post_as_ho12 with 300s (1) cores
% 0.24/0.28 % Starting new_bool_9 with 300s (1) cores
% 0.24/0.28 % Starting post_as_ho1 with 300s (1) cores
% 0.24/0.28 % Starting post_as_ho4 with 300s (1) cores
% 0.24/0.28 % Starting post_as_ho2 with 300s (1) cores
% 0.24/0.28 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.24/0.28 % Starting full_lambda_10 with 300s (1) cores
% 0.24/0.28 % Starting new_ho_8 with 300s (1) cores
% 0.24/0.28 % post_as_ho12 with pid 2273304 completed with status 0
% 0.24/0.28 % Result found by post_as_ho12
% 0.24/0.28 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.28 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.28 % Starting post_as_ho12 with 300s (1) cores
% 0.24/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.28 % No SInE strategy applied
% 0.24/0.28 % Search class: HGHPF-FFSF21-SSSFFMNN
% 0.24/0.28 % partial match(1): HGHSF-FFSF21-SSSFFMNN
% 0.24/0.28 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.28 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.28 % SubtermCWHack with pid 2273314 completed with status 10
% 0.24/0.28 % Starting post_as_ho5 with 181s (1) cores
% 0.24/0.28 % post_as_ho5 with pid 2273323 completed with status 0
% 0.24/0.28 % Result found by post_as_ho5
% 0.24/0.28 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.28 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.28 % Starting post_as_ho12 with 300s (1) cores
% 0.24/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.28 % No SInE strategy applied
% 0.24/0.28 % Search class: HGHPF-FFSF21-SSSFFMNN
% 0.24/0.28 % partial match(1): HGHSF-FFSF21-SSSFFMNN
% 0.24/0.28 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.28 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.28 % SubtermCWHack with pid 2273314 completed with status 10
% 0.24/0.28 % Starting post_as_ho5 with 181s (1) cores
% 0.24/0.28 % Preprocessing time : 0.001 s
% 0.24/0.28 % Presaturation interreduction done
% 0.24/0.28
% 0.24/0.28 % Proof found!
% 0.24/0.28 % SZS status Theorem
% 0.24/0.28 % SZS output start CNFRefutation
% See solution above
% 0.24/0.28 % Parsed axioms : 5
% 0.24/0.28 % Removed by relevancy pruning/SinE : 0
% 0.24/0.28 % Initial clauses : 12
% 0.24/0.28 % Removed in clause preprocessing : 4
% 0.24/0.28 % Initial clauses in saturation : 8
% 0.24/0.28 % Processed clauses : 24
% 0.24/0.28 % ...of these trivial : 0
% 0.24/0.28 % ...subsumed : 3
% 0.24/0.28 % ...remaining for further processing : 21
% 0.24/0.28 % Other redundant clauses eliminated : 12
% 0.24/0.28 % Clauses deleted for lack of memory : 0
% 0.24/0.28 % Backward-subsumed : 0
% 0.24/0.28 % Backward-rewritten : 0
% 0.24/0.28 % Generated clauses : 42
% 0.24/0.28 % ...of the previous two non-redundant : 26
% 0.24/0.28 % ...aggressively subsumed : 0
% 0.24/0.28 % Contextual simplify-reflections : 0
% 0.24/0.28 % Paramodulations : 23
% 0.24/0.28 % Factorizations : 4
% 0.24/0.28 % NegExts : 0
% 0.24/0.28 % Equation resolutions : 15
% 0.24/0.28 % Disequality decompositions : 0
% 0.24/0.28 % Total rewrite steps : 7
% 0.24/0.28 % ...of those cached : 5
% 0.24/0.28 % Propositional unsat checks : 0
% 0.24/0.28 % Propositional check models : 0
% 0.24/0.28 % Propositional check unsatisfiable : 0
% 0.24/0.28 % Propositional clauses : 0
% 0.24/0.28 % Propositional clauses after purity: 0
% 0.24/0.28 % Propositional unsat core size : 0
% 0.24/0.28 % Propositional preprocessing time : 0.000
% 0.24/0.28 % Propositional encoding time : 0.000
% 0.24/0.28 % Propositional solver time : 0.000
% 0.24/0.28 % Success case prop preproc time : 0.000
% 0.24/0.28 % Success case prop encoding time : 0.000
% 0.24/0.28 % Success case prop solver time : 0.000
% 0.24/0.28 % Current number of processed clauses : 13
% 0.24/0.28 % Positive orientable unit clauses : 4
% 0.24/0.28 % Positive unorientable unit clauses: 0
% 0.24/0.28 % Negative unit clauses : 0
% 0.24/0.28 % Non-unit-clauses : 9
% 0.24/0.28 % Current number of unprocessed clauses: 18
% 0.24/0.28 % ...number of literals in the above : 46
% 0.24/0.28 % Current number of archived formulas : 0
% 0.24/0.28 % Current number of archived clauses : 8
% 0.24/0.28 % Clause-clause subsumption calls (NU) : 3
% 0.24/0.28 % Rec. Clause-clause subsumption calls : 3
% 0.24/0.28 % Non-unit clause-clause subsumptions : 3
% 0.24/0.28 % Unit Clause-clause subsumption calls : 0
% 0.24/0.28 % Rewrite failures with RHS unbound : 0
% 0.24/0.28 % BW rewrite match attempts : 1
% 0.24/0.28 % BW rewrite match successes : 0
% 0.24/0.28 % Condensation attempts : 0
% 0.24/0.28 % Condensation successes : 0
% 0.24/0.28 % Termbank termtop insertions : 2520
% 0.24/0.28 % Search garbage collected termcells : 178
% 0.24/0.28
% 0.24/0.28 % -------------------------------------------------
% 0.24/0.28 % User time : 0.009 s
% 0.24/0.28 % System time : 0.006 s
% 0.24/0.28 % Total time : 0.015 s
% 0.24/0.28 % Maximum resident set size: 3584 pages
% 0.24/0.28
% 0.24/0.28 % -------------------------------------------------
% 0.24/0.28 % User time : 0.010 s
% 0.24/0.28 % System time : 0.012 s
% 0.24/0.28 % Total time : 0.022 s
% 0.24/0.28 % Maximum resident set size: 4608 pages
% 0.24/0.28 % E exiting
%------------------------------------------------------------------------------