%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV397^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 : n003.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:28 AM UTC 2026
% Result : Theorem 0.11s 0.22s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 83 ( 0 equ; 0 cnn)
% Maximal formula atoms : 44 ( 5 avg)
% Number of connectives : 190 ( 39 ~; 52 |; 15 &; 82 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 2 ( 0 ^; 2 !; 0 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
cZ: a > $o ).
thf(decl_24,type,
cY: a > $o ).
thf(decl_25,type,
cX: a > $o ).
thf(decl_26,type,
esk1_0: a ).
thf(cTHM59_pme,conjecture,
! [X1: a] :
( ( ( ( cX @ X1 )
& ( cY @ X1 ) )
| ( cZ @ X1 ) )
<=> ( ( ( cX @ X1 )
| ( cZ @ X1 ) )
& ( ( cY @ X1 )
| ( cZ @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WmfA0kOx80/E---3.1_2662145.p',cTHM59_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a] :
( ( ( ( cX @ X1 )
& ( cY @ X1 ) )
| ( cZ @ X1 ) )
<=> ( ( ( cX @ X1 )
| ( cZ @ X1 ) )
& ( ( cY @ X1 )
| ( cZ @ X1 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM59_pme]) ).
thf(c_0_2,negated_conjecture,
( ( ~ ( cY @ esk1_0 )
| ~ ( cX @ esk1_0 )
| ~ ( cX @ esk1_0 )
| ~ ( cY @ esk1_0 ) )
& ( ~ ( cZ @ esk1_0 )
| ~ ( cX @ esk1_0 )
| ~ ( cX @ esk1_0 )
| ~ ( cY @ esk1_0 ) )
& ( ~ ( cY @ esk1_0 )
| ~ ( cZ @ esk1_0 )
| ~ ( cX @ esk1_0 )
| ~ ( cY @ esk1_0 ) )
& ( ~ ( cZ @ esk1_0 )
| ~ ( cZ @ esk1_0 )
| ~ ( cX @ esk1_0 )
| ~ ( cY @ esk1_0 ) )
& ( ~ ( cY @ esk1_0 )
| ~ ( cX @ esk1_0 )
| ~ ( cZ @ esk1_0 ) )
& ( ~ ( cZ @ esk1_0 )
| ~ ( cX @ esk1_0 )
| ~ ( cZ @ esk1_0 ) )
& ( ~ ( cY @ esk1_0 )
| ~ ( cZ @ esk1_0 )
| ~ ( cZ @ esk1_0 ) )
& ( ~ ( cZ @ esk1_0 )
| ~ ( cZ @ esk1_0 )
| ~ ( cZ @ esk1_0 ) )
& ( ( cX @ esk1_0 )
| ( cZ @ esk1_0 )
| ( cX @ esk1_0 )
| ( cZ @ esk1_0 ) )
& ( ( cY @ esk1_0 )
| ( cZ @ esk1_0 )
| ( cX @ esk1_0 )
| ( cZ @ esk1_0 ) )
& ( ( cX @ esk1_0 )
| ( cZ @ esk1_0 )
| ( cY @ esk1_0 )
| ( cZ @ esk1_0 ) )
& ( ( cY @ esk1_0 )
| ( cZ @ esk1_0 )
| ( cY @ esk1_0 )
| ( cZ @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,
( ( cY @ esk1_0 )
| ( cZ @ esk1_0 )
| ( cY @ esk1_0 )
| ( cZ @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ~ ( cZ @ esk1_0 )
| ~ ( cZ @ esk1_0 )
| ~ ( cZ @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( cX @ esk1_0 )
| ( cZ @ esk1_0 )
| ( cX @ esk1_0 )
| ( cZ @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ~ ( cY @ esk1_0 )
| ~ ( cX @ esk1_0 )
| ~ ( cX @ esk1_0 )
| ~ ( cY @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( ( cZ @ esk1_0 )
| ( cY @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
~ ( cZ @ esk1_0 ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_9,negated_conjecture,
( ( cZ @ esk1_0 )
| ( cX @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
( ~ ( cY @ esk1_0 )
| ~ ( cX @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
cY @ esk1_0,
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,negated_conjecture,
cX @ esk1_0,
inference(sr,[status(thm)],[c_0_9,c_0_8]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV397^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.16 % Computer : n003.cluster.edu
% 0.11/0.16 % Model : x86_64 x86_64
% 0.11/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.16 % Memory : 8046.5625MB
% 0.11/0.16 % OS : Linux 6.8.0-71-generic
% 0.11/0.16 % CPULimit : 300
% 0.11/0.16 % WCLimit : 300
% 0.11/0.16 % DateTime : Tue Sep 29 15:45:58 UTC 2026
% 0.11/0.16 % CPUTime :
% 0.11/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.20 Running higher-order theorem proving
% 0.11/0.21 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.WmfA0kOx80/E---3.1_2662145.p
% 0.11/0.22 % Version: 3.5.1-ho
% 0.11/0.22 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.11/0.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.22 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.22 % Starting ho_unfolding_6 with 300s (1) cores
% 0.11/0.22 % Starting sh4l with 300s (1) cores
% 0.11/0.22 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.11/0.22 % ho_unfolding_6 with pid 2662159 completed with status 0
% 0.11/0.22 % Result found by ho_unfolding_6
% 0.11/0.22 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.11/0.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.22 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.22 % Starting ho_unfolding_6 with 300s (1) cores
% 0.11/0.22 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.22 % No SInE strategy applied
% 0.11/0.22 % Search class: HGHNF-FFSS00-SFFFFFNN
% 0.11/0.22 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.22 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.22 % SubtermCWHack with pid 2662163 completed with status 0
% 0.11/0.22 % Result found by SubtermCWHack
% 0.11/0.22 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.11/0.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.22 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.22 % Starting ho_unfolding_6 with 300s (1) cores
% 0.11/0.22 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.22 % No SInE strategy applied
% 0.11/0.22 % Search class: HGHNF-FFSS00-SFFFFFNN
% 0.11/0.22 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.22 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.22 % Preprocessing time : 0.001 s
% 0.11/0.22
% 0.11/0.22 % Proof found!
% 0.11/0.22 % SZS status Theorem
% 0.11/0.22 % SZS output start CNFRefutation
% See solution above
% 0.11/0.22 % Parsed axioms : 5
% 0.11/0.22 % Removed by relevancy pruning/SinE : 0
% 0.11/0.22 % Initial clauses : 16
% 0.11/0.22 % Removed in clause preprocessing : 4
% 0.11/0.22 % Initial clauses in saturation : 12
% 0.11/0.22 % Processed clauses : 6
% 0.11/0.22 % ...of these trivial : 0
% 0.11/0.22 % ...subsumed : 2
% 0.11/0.22 % ...remaining for further processing : 3
% 0.11/0.22 % Other redundant clauses eliminated : 0
% 0.11/0.22 % Clauses deleted for lack of memory : 0
% 0.11/0.22 % Backward-subsumed : 0
% 0.11/0.22 % Backward-rewritten : 0
% 0.11/0.22 % Generated clauses : 0
% 0.11/0.22 % ...of the previous two non-redundant : 0
% 0.11/0.22 % ...aggressively subsumed : 0
% 0.11/0.22 % Contextual simplify-reflections : 0
% 0.11/0.22 % Paramodulations : 0
% 0.11/0.22 % Factorizations : 0
% 0.11/0.22 % NegExts : 0
% 0.11/0.22 % Equation resolutions : 0
% 0.11/0.22 % Disequality decompositions : 0
% 0.11/0.22 % Total rewrite steps : 4
% 0.11/0.22 % ...of those cached : 2
% 0.11/0.22 % Propositional unsat checks : 0
% 0.11/0.22 % Propositional check models : 0
% 0.11/0.22 % Propositional check unsatisfiable : 0
% 0.11/0.22 % Propositional clauses : 0
% 0.11/0.22 % Propositional clauses after purity: 0
% 0.11/0.22 % Propositional unsat core size : 0
% 0.11/0.22 % Propositional preprocessing time : 0.000
% 0.11/0.22 % Propositional encoding time : 0.000
% 0.11/0.22 % Propositional solver time : 0.000
% 0.11/0.22 % Success case prop preproc time : 0.000
% 0.11/0.22 % Success case prop encoding time : 0.000
% 0.11/0.22 % Success case prop solver time : 0.000
% 0.11/0.22 % Current number of processed clauses : 3
% 0.11/0.22 % Positive orientable unit clauses : 2
% 0.11/0.22 % Positive unorientable unit clauses: 0
% 0.11/0.22 % Negative unit clauses : 1
% 0.11/0.22 % Non-unit-clauses : 0
% 0.11/0.22 % Current number of unprocessed clauses: 6
% 0.11/0.22 % ...number of literals in the above : 18
% 0.11/0.22 % Current number of archived formulas : 0
% 0.11/0.22 % Current number of archived clauses : 0
% 0.11/0.22 % Clause-clause subsumption calls (NU) : 0
% 0.11/0.22 % Rec. Clause-clause subsumption calls : 0
% 0.11/0.22 % Non-unit clause-clause subsumptions : 0
% 0.11/0.22 % Unit Clause-clause subsumption calls : 0
% 0.11/0.22 % Rewrite failures with RHS unbound : 0
% 0.11/0.22 % BW rewrite match attempts : 0
% 0.11/0.22 % BW rewrite match successes : 0
% 0.11/0.22 % Condensation attempts : 0
% 0.11/0.22 % Condensation successes : 0
% 0.11/0.22 % Termbank termtop insertions : 713
% 0.11/0.22 % Search garbage collected termcells : 131
% 0.11/0.22
% 0.11/0.22 % -------------------------------------------------
% 0.11/0.22 % User time : 0.002 s
% 0.11/0.22 % System time : 0.002 s
% 0.11/0.22 % Total time : 0.004 s
% 0.11/0.22 % Maximum resident set size: 3576 pages
% 0.11/0.22
% 0.11/0.22 % -------------------------------------------------
% 0.11/0.22 % User time : 0.004 s
% 0.11/0.22 % System time : 0.005 s
% 0.11/0.22 % Total time : 0.010 s
% 0.11/0.22 % Maximum resident set size: 4864 pages
% 0.11/0.22 % E exiting
%------------------------------------------------------------------------------