%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV319^6 : TPTP v9.3.1. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:23 AM UTC 2026
% Result : Theorem 30.48s 4.19s
% Output : CNFRefutation 30.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 68 ( 0 equ; 0 cnn)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 296 ( 19 ~; 21 |; 13 &; 229 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 10 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 71 ( 14 ^; 55 !; 2 ?; 71 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
cLQ: a > a > $o ).
thf(decl_24,type,
esk1_0: ( a > $o ) > a ).
thf(decl_25,type,
esk2_2: ( a > $o ) > a > a ).
thf(decl_26,type,
esk3_0: a > a ).
thf(cTHM145L1_pme,conjecture,
! [X1: ( a > $o ) > a] :
( ( ! [X2: a,X3: a,X4: a] :
( ( ( cLQ @ X2 @ X3 )
& ( cLQ @ X3 @ X4 ) )
=> ( cLQ @ X2 @ X4 ) )
& ! [X5: a > $o] :
( ! [X4: a] :
( ( X5 @ X4 )
=> ( cLQ @ X4 @ ( X1 @ X5 ) ) )
& ! [X6: a] :
( ! [X7: a] :
( ( X5 @ X7 )
=> ( cLQ @ X7 @ X6 ) )
=> ( cLQ @ ( X1 @ X5 ) @ X6 ) ) ) )
=> ! [X8: a > a] :
( ! [X2: a,X3: a] :
( ( cLQ @ X2 @ X3 )
=> ( cLQ @ ( X8 @ X2 ) @ ( X8 @ X3 ) ) )
=> ? [X9: a] :
( ( cLQ @ X9 @ ( X8 @ X9 ) )
& ( cLQ @ ( X8 @ X9 ) @ X9 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.K5CLK8kl0I/E---3.1_1391897.p',cTHM145L1_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( a > $o ) > a] :
( ( ! [X2: a,X3: a,X4: a] :
( ( ( cLQ @ X2 @ X3 )
& ( cLQ @ X3 @ X4 ) )
=> ( cLQ @ X2 @ X4 ) )
& ! [X5: a > $o] :
( ! [X4: a] :
( ( X5 @ X4 )
=> ( cLQ @ X4 @ ( X1 @ X5 ) ) )
& ! [X6: a] :
( ! [X7: a] :
( ( X5 @ X7 )
=> ( cLQ @ X7 @ X6 ) )
=> ( cLQ @ ( X1 @ X5 ) @ X6 ) ) ) )
=> ! [X8: a > a] :
( ! [X2: a,X3: a] :
( ( cLQ @ X2 @ X3 )
=> ( cLQ @ ( X8 @ X2 ) @ ( X8 @ X3 ) ) )
=> ? [X9: a] :
( ( cLQ @ X9 @ ( X8 @ X9 ) )
& ( cLQ @ ( X8 @ X9 ) @ X9 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM145L1_pme]) ).
thf(c_0_2,negated_conjecture,
! [X23: a,X24: a,X25: a,X26: a > $o,X27: a,X28: a,X31: a,X32: a,X33: a] :
( ( ~ ( cLQ @ X23 @ X24 )
| ~ ( cLQ @ X24 @ X25 )
| ( cLQ @ X23 @ X25 ) )
& ( ~ ( X26 @ X27 )
| ( cLQ @ X27 @ ( esk1_0 @ X26 ) ) )
& ( ( X26 @ ( esk2_2 @ X26 @ X28 ) )
| ( cLQ @ ( esk1_0 @ X26 ) @ X28 ) )
& ( ~ ( cLQ @ ( esk2_2 @ X26 @ X28 ) @ X28 )
| ( cLQ @ ( esk1_0 @ X26 ) @ X28 ) )
& ( ~ ( cLQ @ X31 @ X32 )
| ( cLQ @ ( esk3_0 @ X31 ) @ ( esk3_0 @ X32 ) ) )
& ( ~ ( cLQ @ X33 @ ( esk3_0 @ X33 ) )
| ~ ( cLQ @ ( esk3_0 @ X33 ) @ X33 ) ) ),
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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X2: a,X3: a,X4: a] :
( ( cLQ @ X2 @ X4 )
| ~ ( cLQ @ X2 @ X3 )
| ~ ( cLQ @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: a,X3: a] :
( ( cLQ @ ( esk3_0 @ X2 ) @ ( esk3_0 @ X3 ) )
| ~ ( cLQ @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X2: a,X4: a,X3: a] :
( ( cLQ @ X2 @ ( esk3_0 @ X3 ) )
| ~ ( cLQ @ X2 @ ( esk3_0 @ X4 ) )
| ~ ( cLQ @ X4 @ X3 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X5: a > $o,X2: a] :
( ( X5 @ ( esk2_2 @ X5 @ X2 ) )
| ( cLQ @ ( esk1_0 @ X5 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X5: a > $o,X2: a] :
( ( cLQ @ X2 @ ( esk1_0 @ X5 ) )
| ~ ( X5 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X2: a,X18: a > a,X8: a > a,X3: a] :
( ( cLQ
@ ( X8
@ ( esk2_2
@ ^ [Z0: a] : ( cLQ @ ( X8 @ Z0 ) @ ( esk3_0 @ ( X18 @ Z0 ) ) )
@ X2 ) )
@ ( esk3_0 @ X3 ) )
| ( cLQ
@ ( esk1_0
@ ^ [Z0: a] : ( cLQ @ ( X8 @ Z0 ) @ ( esk3_0 @ ( X18 @ Z0 ) ) ) )
@ X2 )
| ~ ( cLQ
@ ( X18
@ ( esk2_2
@ ^ [Z0: a] : ( cLQ @ ( X8 @ Z0 ) @ ( esk3_0 @ ( X18 @ Z0 ) ) )
@ X2 ) )
@ X3 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X40: a > a > $o,X2: a] :
( ( cLQ
@ ( esk2_2
@ ^ [Z0: a] : ( X40 @ Z0 @ Z0 )
@ X2 )
@ ( esk1_0
@ ^ [Z0: a] : ( X40 @ Z0 @ Z0 ) ) )
| ( cLQ
@ ( esk1_0
@ ^ [Z0: a] : ( X40 @ Z0 @ Z0 ) )
@ X2 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X5: a > $o,X2: a] :
( ( cLQ @ ( esk1_0 @ X5 ) @ X2 )
| ~ ( cLQ @ ( esk2_2 @ X5 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X2: a] :
( ( cLQ
@ ( esk2_2
@ ^ [Z0: a] : ( cLQ @ Z0 @ ( esk3_0 @ Z0 ) )
@ X2 )
@ ( esk3_0
@ ( esk1_0
@ ^ [Z0: a] : ( cLQ @ Z0 @ ( esk3_0 @ Z0 ) ) ) ) )
| ( cLQ
@ ( esk1_0
@ ^ [Z0: a] : ( cLQ @ Z0 @ ( esk3_0 @ Z0 ) ) )
@ X2 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X8: a > a,X2: a] :
( ( cLQ @ ( esk3_0 @ X2 )
@ ( esk1_0
@ ^ [Z0: a] : ( cLQ @ Z0 @ ( esk3_0 @ ( X8 @ Z0 ) ) ) ) )
| ~ ( cLQ @ X2 @ ( X8 @ ( esk3_0 @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
thf(c_0_13,negated_conjecture,
( cLQ
@ ( esk1_0
@ ^ [Z0: a] : ( cLQ @ Z0 @ ( esk3_0 @ Z0 ) ) )
@ ( esk3_0
@ ( esk1_0
@ ^ [Z0: a] : ( cLQ @ Z0 @ ( esk3_0 @ Z0 ) ) ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X2: a] :
( ~ ( cLQ @ X2 @ ( esk3_0 @ X2 ) )
| ~ ( cLQ @ ( esk3_0 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
( cLQ
@ ( esk3_0
@ ( esk1_0
@ ^ [Z0: a] : ( cLQ @ Z0 @ ( esk3_0 @ Z0 ) ) ) )
@ ( esk1_0
@ ^ [Z0: a] : ( cLQ @ Z0 @ ( esk3_0 @ Z0 ) ) ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV319^6 : TPTP v9.3.1. Released v5.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n001.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 15:42:36 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.24 Running higher-order theorem proving
% 0.07/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.K5CLK8kl0I/E---3.1_1391897.p
% 30.48/4.19 % Version: 3.5.1-ho
% 30.48/4.19 % Preprocessing class: HSSSSMSSSSSNHHA.
% 30.48/4.19 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 30.48/4.19 % Starting sh2lt with 1200s (4) cores
% 30.48/4.19 % Starting new_ho_10_unif with 300s (1) cores
% 30.48/4.19 % Starting full_lambda_6 with 300s (1) cores
% 30.48/4.19 % Starting post_as_ho1 with 300s (1) cores
% 30.48/4.19 % Starting ehoh_best3_rw with 300s (1) cores
% 30.48/4.19 % sh2lt with pid 1391923 completed with status 0
% 30.48/4.19 % Result found by sh2lt
% 30.48/4.19 % Preprocessing class: HSSSSMSSSSSNHHA.
% 30.48/4.19 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 30.48/4.19 % Starting sh2lt with 1200s (4) cores
% 30.48/4.19 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 30.48/4.19 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 30.48/4.19 % Search class: HGHNF-FFSF22-SHHFFSBN
% 30.48/4.19 % Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 30.48/4.19 % Starting SubtermCWHack with 121s (1) cores
% 30.48/4.19 % Starting new_ho_10_unif with 400s (1) cores
% 30.48/4.19 % Starting lpo8_s with 201s (1) cores
% 30.48/4.19 % Starting sh5l with 201s (1) cores
% 30.48/4.19 % new_ho_10_unif with pid 1391930 completed with status 0
% 30.48/4.19 % Result found by new_ho_10_unif
% 30.48/4.19 % Preprocessing class: HSSSSMSSSSSNHHA.
% 30.48/4.19 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 30.48/4.19 % Starting sh2lt with 1200s (4) cores
% 30.48/4.19 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 30.48/4.19 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 30.48/4.19 % Search class: HGHNF-FFSF22-SHHFFSBN
% 30.48/4.19 % Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 30.48/4.19 % Starting SubtermCWHack with 121s (1) cores
% 30.48/4.19 % Starting new_ho_10_unif with 400s (1) cores
% 30.48/4.19 % Preprocessing time : 0.001 s
% 30.48/4.19 % Presaturation interreduction done
% 30.48/4.19
% 30.48/4.19 % Proof found!
% 30.48/4.19 % SZS status Theorem
% 30.48/4.19 % SZS output start CNFRefutation
% See solution above
% 30.48/4.19 % Parsed axioms : 3
% 30.48/4.19 % Removed by relevancy pruning/SinE : 2
% 30.48/4.19 % Initial clauses : 6
% 30.48/4.19 % Removed in clause preprocessing : 0
% 30.48/4.19 % Initial clauses in saturation : 6
% 30.48/4.19 % Processed clauses : 865
% 30.48/4.19 % ...of these trivial : 128
% 30.48/4.19 % ...subsumed : 272
% 30.48/4.19 % ...remaining for further processing : 465
% 30.48/4.19 % Other redundant clauses eliminated : 0
% 30.48/4.19 % Clauses deleted for lack of memory : 0
% 30.48/4.19 % Backward-subsumed : 29
% 30.48/4.19 % Backward-rewritten : 47
% 30.48/4.19 % Generated clauses : 48580
% 30.48/4.19 % ...of the previous two non-redundant : 41700
% 30.48/4.19 % ...aggressively subsumed : 0
% 30.48/4.19 % Contextual simplify-reflections : 0
% 30.48/4.19 % Paramodulations : 48396
% 30.48/4.19 % Factorizations : 183
% 30.48/4.19 % NegExts : 0
% 30.48/4.19 % Equation resolutions : 1
% 30.48/4.19 % Disequality decompositions : 0
% 30.48/4.19 % Total rewrite steps : 7285
% 30.48/4.19 % ...of those cached : 6320
% 30.48/4.19 % Propositional unsat checks : 0
% 30.48/4.19 % Propositional check models : 0
% 30.48/4.19 % Propositional check unsatisfiable : 0
% 30.48/4.19 % Propositional clauses : 0
% 30.48/4.19 % Propositional clauses after purity: 0
% 30.48/4.19 % Propositional unsat core size : 0
% 30.48/4.19 % Propositional preprocessing time : 0.000
% 30.48/4.19 % Propositional encoding time : 0.000
% 30.48/4.19 % Propositional solver time : 0.000
% 30.48/4.19 % Success case prop preproc time : 0.000
% 30.48/4.19 % Success case prop encoding time : 0.000
% 30.48/4.19 % Success case prop solver time : 0.000
% 30.48/4.19 % Current number of processed clauses : 383
% 30.48/4.19 % Positive orientable unit clauses : 92
% 30.48/4.19 % Positive unorientable unit clauses: 0
% 30.48/4.19 % Negative unit clauses : 15
% 30.48/4.19 % Non-unit-clauses : 276
% 30.48/4.19 % Current number of unprocessed clauses: 40342
% 30.48/4.19 % ...number of literals in the above : 125900
% 30.48/4.19 % Current number of archived formulas : 0
% 30.48/4.19 % Current number of archived clauses : 82
% 30.48/4.19 % Clause-clause subsumption calls (NU) : 11966
% 30.48/4.19 % Rec. Clause-clause subsumption calls : 10032
% 30.48/4.19 % Non-unit clause-clause subsumptions : 293
% 30.48/4.19 % Unit Clause-clause subsumption calls : 2671
% 30.48/4.19 % Rewrite failures with RHS unbound : 0
% 30.48/4.19 % BW rewrite match attempts : 2202
% 30.48/4.19 % BW rewrite match successes : 57
% 30.48/4.19 % Condensation attempts : 865
% 30.48/4.19 % Condensation successes : 9
% 30.48/4.19 % Termbank termtop insertions : 12460589
% 30.48/4.19 % Search garbage collected termcells : 332
% 30.48/4.19
% 30.48/4.19 % -------------------------------------------------
% 30.48/4.19 % User time : 3.692 s
% 30.48/4.19 % System time : 0.167 s
% 30.48/4.19 % Total time : 3.859 s
% 30.48/4.19 % Maximum resident set size: 3640 pages
% 30.48/4.19
% 30.48/4.19 % -------------------------------------------------
% 30.48/4.19 % User time : 14.875 s
% 30.48/4.19 % System time : 0.432 s
% 30.48/4.19 % Total time : 15.307 s
% 30.48/4.19 % Maximum resident set size: 4864 pages
% 30.48/4.19 % E exiting
%------------------------------------------------------------------------------