%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV229^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 : n019.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:14 AM UTC 2026
% Result : Theorem 0.10s 0.26s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 1
% Syntax : Number of formulae : 38 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 143 ( 2 equ; 0 cnn)
% Maximal formula atoms : 44 ( 3 avg)
% Number of connectives : 319 ( 60 ~; 83 |; 17 &; 149 @)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 4 ^; 25 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
cE: a > $o ).
thf(decl_24,type,
cD: a > $o ).
thf(decl_25,type,
epred1_0: a > $o ).
thf(decl_26,type,
esk1_0: a ).
thf(decl_27,type,
esk2_0: a ).
thf(decl_28,type,
esk3_0: a ).
thf(cX5209_pme,conjecture,
( ( ^ [X1: a > $o] :
! [X2: a] :
( ( X1 @ X2 )
=> ( ( cD @ X2 )
& ( cE @ X2 ) ) ) )
= ( ^ [X3: a > $o] :
( ! [X4: a] :
( ( X3 @ X4 )
=> ( cD @ X4 ) )
& ! [X4: a] :
( ( X3 @ X4 )
=> ( cE @ X4 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.48bb4rlX8w/E---3.1_914861.p',cX5209_pme) ).
thf(c_0_1,negated_conjecture,
( ( ^ [X1: a > $o] :
! [X2: a] :
( ( X1 @ X2 )
=> ( ( cD @ X2 )
& ( cE @ X2 ) ) ) )
!= ( ^ [X3: a > $o] :
( ! [X4: a] :
( ( X3 @ X4 )
=> ( cD @ X4 ) )
& ! [X4: a] :
( ( X3 @ X4 )
=> ( cE @ X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cX5209_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X5: a > $o] :
( ! [X2: a] :
( ( X5 @ X2 )
=> ( ( cD @ X2 )
& ( cE @ X2 ) ) )
<=> ( ! [X4: a] :
( ( X5 @ X4 )
=> ( cD @ X4 ) )
& ! [X4: a] :
( ( X5 @ X4 )
=> ( cE @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
! [X10: a,X11: a,X12: a] :
( ( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( cE @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) )
& ( ~ ( cE @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) )
& ( ( epred1_0 @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) )
& ( ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) )
& ( ~ ( epred1_0 @ X11 )
| ( cD @ X11 )
| ( cD @ X10 )
| ~ ( epred1_0 @ X10 ) )
& ( ~ ( epred1_0 @ X12 )
| ( cE @ X12 )
| ( cD @ X10 )
| ~ ( epred1_0 @ X10 ) )
& ( ~ ( epred1_0 @ X11 )
| ( cD @ X11 )
| ( cE @ X10 )
| ~ ( epred1_0 @ X10 ) )
& ( ~ ( epred1_0 @ X12 )
| ( cE @ X12 )
| ( cE @ X10 )
| ~ ( epred1_0 @ X10 ) ) ),
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: a,X4: a] :
( ( cE @ X2 )
| ( cE @ X4 )
| ~ ( epred1_0 @ X2 )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( cE @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X2: a] :
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk2_0 )
| ( cE @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X2: a,X4: a] :
( ( cD @ X2 )
| ( cD @ X4 )
| ~ ( epred1_0 @ X2 )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_5]) ).
thf(c_0_10,negated_conjecture,
! [X2: a] :
( ( epred1_0 @ esk1_0 )
| ( cD @ esk2_0 )
| ( cD @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_11,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( cD @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_12,negated_conjecture,
( ( cD @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
thf(c_0_13,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_14,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( cE @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X2: a] :
( ( epred1_0 @ esk1_0 )
| ( cE @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_14]),c_0_15]) ).
thf(c_0_17,negated_conjecture,
epred1_0 @ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
thf(c_0_18,negated_conjecture,
! [X2: a] :
( ( cE @ esk1_0 )
| ( cE @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_4,c_0_17]) ).
thf(c_0_19,negated_conjecture,
! [X2: a] :
( ( cD @ esk1_0 )
| ( cD @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
thf(c_0_20,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_21,negated_conjecture,
cE @ esk1_0,
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
thf(c_0_22,negated_conjecture,
cD @ esk1_0,
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
thf(c_0_23,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ~ ( cE @ esk3_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_24,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),c_0_22])]) ).
thf(c_0_25,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ~ ( cE @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_21])]),c_0_22])]) ).
thf(c_0_26,negated_conjecture,
! [X2: a] :
( ( epred1_0 @ esk2_0 )
| ( cE @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_24]),c_0_25]) ).
thf(c_0_27,negated_conjecture,
epred1_0 @ esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
thf(c_0_28,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_29,negated_conjecture,
! [X2: a] :
( ( cD @ esk2_0 )
| ( cD @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_27]) ).
thf(c_0_30,negated_conjecture,
( ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_31,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ~ ( cD @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_21])]),c_0_22])]) ).
thf(c_0_32,negated_conjecture,
cD @ esk2_0,
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
thf(c_0_33,negated_conjecture,
( ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_21])]),c_0_22])]) ).
thf(c_0_34,negated_conjecture,
epred1_0 @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
thf(c_0_35,negated_conjecture,
~ ( cE @ esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_32])]) ).
thf(c_0_36,negated_conjecture,
! [X2: a] :
( ( cE @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_34]),c_0_35]) ).
thf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV229^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.10/0.18 % Computer : n019.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 15:23:17 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/0.24 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.48bb4rlX8w/E---3.1_914861.p
% 0.10/0.26 % Version: 3.5.1-ho
% 0.10/0.26 % Preprocessing class: HSSSSMSSSSSNHHN.
% 0.10/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.26 % Starting post_as_ho2 with 1500s (5) cores
% 0.10/0.26 % Starting new_ho_13 with 300s (1) cores
% 0.10/0.26 % Starting new_ho_8 with 300s (1) cores
% 0.10/0.26 % Starting new_ho_4 with 300s (1) cores
% 0.10/0.26 % new_ho_13 with pid 914875 completed with status 0
% 0.10/0.26 % Result found by new_ho_13
% 0.10/0.26 % Preprocessing class: HSSSSMSSSSSNHHN.
% 0.10/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.26 % Starting post_as_ho2 with 1500s (5) cores
% 0.10/0.26 % Starting new_ho_13 with 300s (1) cores
% 0.10/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.26 % No SInE strategy applied
% 0.10/0.26 % Search class: HGHNF-FFSF00-SHHFFFNN
% 0.10/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.26 % SubtermCWHack with pid 914878 completed with status 0
% 0.10/0.26 % Result found by SubtermCWHack
% 0.10/0.26 % Preprocessing class: HSSSSMSSSSSNHHN.
% 0.10/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.26 % Starting post_as_ho2 with 1500s (5) cores
% 0.10/0.26 % Starting new_ho_13 with 300s (1) cores
% 0.10/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.26 % No SInE strategy applied
% 0.10/0.26 % Search class: HGHNF-FFSF00-SHHFFFNN
% 0.10/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.26 % Preprocessing time : 0.001 s
% 0.10/0.26
% 0.10/0.26 % Proof found!
% 0.10/0.26 % SZS status Theorem
% 0.10/0.26 % SZS output start CNFRefutation
% See solution above
% 0.10/0.26 % Parsed axioms : 4
% 0.10/0.26 % Removed by relevancy pruning/SinE : 0
% 0.10/0.26 % Initial clauses : 15
% 0.10/0.26 % Removed in clause preprocessing : 3
% 0.10/0.26 % Initial clauses in saturation : 12
% 0.10/0.26 % Processed clauses : 44
% 0.10/0.26 % ...of these trivial : 2
% 0.10/0.26 % ...subsumed : 4
% 0.10/0.26 % ...remaining for further processing : 38
% 0.10/0.26 % Other redundant clauses eliminated : 0
% 0.10/0.26 % Clauses deleted for lack of memory : 0
% 0.10/0.26 % Backward-subsumed : 9
% 0.10/0.26 % Backward-rewritten : 19
% 0.10/0.26 % Generated clauses : 37
% 0.10/0.26 % ...of the previous two non-redundant : 40
% 0.10/0.26 % ...aggressively subsumed : 0
% 0.10/0.26 % Contextual simplify-reflections : 6
% 0.10/0.26 % Paramodulations : 37
% 0.10/0.26 % Factorizations : 0
% 0.10/0.26 % NegExts : 0
% 0.10/0.26 % Equation resolutions : 0
% 0.10/0.26 % Disequality decompositions : 0
% 0.10/0.26 % Total rewrite steps : 28
% 0.10/0.26 % ...of those cached : 21
% 0.10/0.26 % Propositional unsat checks : 0
% 0.10/0.26 % Propositional check models : 0
% 0.10/0.26 % Propositional check unsatisfiable : 0
% 0.10/0.26 % Propositional clauses : 0
% 0.10/0.26 % Propositional clauses after purity: 0
% 0.10/0.26 % Propositional unsat core size : 0
% 0.10/0.26 % Propositional preprocessing time : 0.000
% 0.10/0.26 % Propositional encoding time : 0.000
% 0.10/0.26 % Propositional solver time : 0.000
% 0.10/0.26 % Success case prop preproc time : 0.000
% 0.10/0.26 % Success case prop encoding time : 0.000
% 0.10/0.26 % Success case prop solver time : 0.000
% 0.10/0.26 % Current number of processed clauses : 10
% 0.10/0.26 % Positive orientable unit clauses : 7
% 0.10/0.26 % Positive unorientable unit clauses: 0
% 0.10/0.26 % Negative unit clauses : 1
% 0.10/0.26 % Non-unit-clauses : 2
% 0.10/0.26 % Current number of unprocessed clauses: 2
% 0.10/0.26 % ...number of literals in the above : 6
% 0.10/0.26 % Current number of archived formulas : 0
% 0.10/0.26 % Current number of archived clauses : 28
% 0.10/0.26 % Clause-clause subsumption calls (NU) : 30
% 0.10/0.26 % Rec. Clause-clause subsumption calls : 25
% 0.10/0.26 % Non-unit clause-clause subsumptions : 19
% 0.10/0.26 % Unit Clause-clause subsumption calls : 0
% 0.10/0.26 % Rewrite failures with RHS unbound : 0
% 0.10/0.26 % BW rewrite match attempts : 6
% 0.10/0.26 % BW rewrite match successes : 6
% 0.10/0.26 % Condensation attempts : 0
% 0.10/0.26 % Condensation successes : 0
% 0.10/0.26 % Termbank termtop insertions : 1464
% 0.10/0.26 % Search garbage collected termcells : 244
% 0.10/0.26
% 0.10/0.26 % -------------------------------------------------
% 0.10/0.26 % User time : 0.003 s
% 0.10/0.26 % System time : 0.001 s
% 0.10/0.26 % Total time : 0.004 s
% 0.10/0.26 % Maximum resident set size: 3632 pages
% 0.10/0.26
% 0.10/0.26 % -------------------------------------------------
% 0.10/0.26 % User time : 0.004 s
% 0.10/0.26 % System time : 0.007 s
% 0.10/0.26 % Total time : 0.011 s
% 0.10/0.26 % Maximum resident set size: 4864 pages
% 0.10/0.26 % E exiting
%------------------------------------------------------------------------------