%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO148^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:43:54 AM UTC 2026
% Result : Theorem 0.10s 0.24s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 78 ( 2 equ; 0 cnn)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 162 ( 34 ~; 35 |; 7 &; 73 @)
% ( 10 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 11 ( 2 ^; 9 !; 0 ?; 11 :)
% 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(cBOOL25,conjecture,
( ! [X1: a] :
( ~ ( cX @ X1 )
<=> ( ( cY @ X1 )
<=> ( cZ @ X1 ) ) )
=> ( cX
= ( ^ [X1: a] :
~ ( ( cY @ X1 )
<=> ( cZ @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mQcjMOTbEs/E---3.1_1015908.p',cBOOL25) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: a] :
( ~ ( cX @ X1 )
<=> ( ( cY @ X1 )
<=> ( cZ @ X1 ) ) )
=> ( cX
= ( ^ [X1: a] :
~ ( ( cY @ X1 )
<=> ( cZ @ X1 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cBOOL25]) ).
thf(c_0_2,negated_conjecture,
~ ( ! [X1: a] :
( ~ ( cX @ X1 )
<=> ( ( cY @ X1 )
<=> ( cZ @ X1 ) ) )
=> ! [X3: a] :
( ( cX @ X3 )
<=> ~ ( ( cY @ X3 )
<=> ( cZ @ X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])])]) ).
thf(c_0_3,negated_conjecture,
! [X4: a] :
( ( ~ ( cY @ X4 )
| ( cZ @ X4 )
| ( cX @ X4 ) )
& ( ~ ( cZ @ X4 )
| ( cY @ X4 )
| ( cX @ X4 ) )
& ( ~ ( cY @ X4 )
| ~ ( cZ @ X4 )
| ~ ( cX @ X4 ) )
& ( ( cY @ X4 )
| ( cZ @ X4 )
| ~ ( cX @ X4 ) )
& ( ~ ( cY @ esk1_0 )
| ( cZ @ esk1_0 )
| ~ ( cX @ esk1_0 ) )
& ( ~ ( cZ @ esk1_0 )
| ( cY @ esk1_0 )
| ~ ( cX @ esk1_0 ) )
& ( ~ ( cY @ esk1_0 )
| ~ ( cZ @ esk1_0 )
| ( cX @ esk1_0 ) )
& ( ( cY @ esk1_0 )
| ( cZ @ esk1_0 )
| ( cX @ esk1_0 ) ) ),
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,
! [X1: a] :
( ( cY @ X1 )
| ( cZ @ X1 )
| ~ ( cX @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( cY @ esk1_0 )
| ( cZ @ esk1_0 )
| ( cX @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( cZ @ esk1_0 )
| ~ ( cY @ esk1_0 )
| ~ ( cX @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X1: a] :
( ( cZ @ X1 )
| ( cX @ X1 )
| ~ ( cY @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
( ( cZ @ esk1_0 )
| ( cY @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ( cY @ esk1_0 )
| ~ ( cZ @ esk1_0 )
| ~ ( cX @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
cZ @ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
( ( cX @ esk1_0 )
| ~ ( cY @ esk1_0 )
| ~ ( cZ @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_12,negated_conjecture,
( ( cY @ esk1_0 )
| ~ ( cX @ esk1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
thf(c_0_13,negated_conjecture,
! [X1: a] :
( ( cY @ X1 )
| ( cX @ X1 )
| ~ ( cZ @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_14,negated_conjecture,
( ( cX @ esk1_0 )
| ~ ( cY @ esk1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10])]) ).
thf(c_0_15,negated_conjecture,
cY @ esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10])]) ).
thf(c_0_16,negated_conjecture,
! [X1: a] :
( ~ ( cY @ X1 )
| ~ ( cZ @ X1 )
| ~ ( cX @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_17,negated_conjecture,
cX @ esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_10]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO148^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.17 % Computer : n019.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 16:35:33 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running higher-order theorem proving
% 0.10/0.22 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.mQcjMOTbEs/E---3.1_1015908.p
% 0.10/0.24 % Version: 3.5.1-ho
% 0.10/0.24 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.24 % Starting post_as_ho10 with 300s (1) cores
% 0.10/0.24 % Starting new_bool_9 with 300s (1) cores
% 0.10/0.24 % Starting sh5l with 300s (1) cores
% 0.10/0.24 % post_as_ho10 with pid 1015936 completed with status 0
% 0.10/0.24 % Result found by post_as_ho10
% 0.10/0.24 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.24 % Starting post_as_ho10 with 300s (1) cores
% 0.10/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.24 % No SInE strategy applied
% 0.10/0.24 % Search class: HGHNF-FFSF00-SSSFFFNN
% 0.10/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.24 % SubtermCWHack with pid 1015946 completed with status 0
% 0.10/0.24 % Result found by SubtermCWHack
% 0.10/0.24 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.24 % Starting post_as_ho10 with 300s (1) cores
% 0.10/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.24 % No SInE strategy applied
% 0.10/0.24 % Search class: HGHNF-FFSF00-SSSFFFNN
% 0.10/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.24 % Preprocessing time : 0.001 s
% 0.10/0.24
% 0.10/0.24 % Proof found!
% 0.10/0.24 % SZS status Theorem
% 0.10/0.24 % SZS output start CNFRefutation
% See solution above
% 0.10/0.24 % Parsed axioms : 5
% 0.10/0.24 % Removed by relevancy pruning/SinE : 0
% 0.10/0.24 % Initial clauses : 12
% 0.10/0.24 % Removed in clause preprocessing : 4
% 0.10/0.24 % Initial clauses in saturation : 8
% 0.10/0.24 % Processed clauses : 14
% 0.10/0.24 % ...of these trivial : 0
% 0.10/0.24 % ...subsumed : 0
% 0.10/0.24 % ...remaining for further processing : 14
% 0.10/0.24 % Other redundant clauses eliminated : 0
% 0.10/0.24 % Clauses deleted for lack of memory : 0
% 0.10/0.24 % Backward-subsumed : 1
% 0.10/0.24 % Backward-rewritten : 6
% 0.10/0.24 % Generated clauses : 18
% 0.10/0.24 % ...of the previous two non-redundant : 6
% 0.10/0.24 % ...aggressively subsumed : 0
% 0.10/0.24 % Contextual simplify-reflections : 1
% 0.10/0.24 % Paramodulations : 18
% 0.10/0.24 % Factorizations : 0
% 0.10/0.24 % NegExts : 0
% 0.10/0.24 % Equation resolutions : 0
% 0.10/0.24 % Disequality decompositions : 0
% 0.10/0.24 % Total rewrite steps : 13
% 0.10/0.24 % ...of those cached : 11
% 0.10/0.24 % Propositional unsat checks : 0
% 0.10/0.24 % Propositional check models : 0
% 0.10/0.24 % Propositional check unsatisfiable : 0
% 0.10/0.24 % Propositional clauses : 0
% 0.10/0.24 % Propositional clauses after purity: 0
% 0.10/0.24 % Propositional unsat core size : 0
% 0.10/0.24 % Propositional preprocessing time : 0.000
% 0.10/0.24 % Propositional encoding time : 0.000
% 0.10/0.24 % Propositional solver time : 0.000
% 0.10/0.24 % Success case prop preproc time : 0.000
% 0.10/0.24 % Success case prop encoding time : 0.000
% 0.10/0.24 % Success case prop solver time : 0.000
% 0.10/0.24 % Current number of processed clauses : 7
% 0.10/0.24 % Positive orientable unit clauses : 3
% 0.10/0.24 % Positive unorientable unit clauses: 0
% 0.10/0.24 % Negative unit clauses : 0
% 0.10/0.24 % Non-unit-clauses : 4
% 0.10/0.24 % Current number of unprocessed clauses: 0
% 0.10/0.24 % ...number of literals in the above : 0
% 0.10/0.24 % Current number of archived formulas : 0
% 0.10/0.24 % Current number of archived clauses : 7
% 0.10/0.24 % Clause-clause subsumption calls (NU) : 2
% 0.10/0.24 % Rec. Clause-clause subsumption calls : 2
% 0.10/0.24 % Non-unit clause-clause subsumptions : 2
% 0.10/0.24 % Unit Clause-clause subsumption calls : 0
% 0.10/0.24 % Rewrite failures with RHS unbound : 0
% 0.10/0.24 % BW rewrite match attempts : 2
% 0.10/0.24 % BW rewrite match successes : 2
% 0.10/0.24 % Condensation attempts : 0
% 0.10/0.24 % Condensation successes : 0
% 0.10/0.24 % Termbank termtop insertions : 1024
% 0.10/0.24 % Search garbage collected termcells : 235
% 0.10/0.24
% 0.10/0.24 % -------------------------------------------------
% 0.10/0.24 % User time : 0.004 s
% 0.10/0.24 % System time : 0.001 s
% 0.10/0.24 % Total time : 0.006 s
% 0.10/0.24 % Maximum resident set size: 3628 pages
% 0.10/0.24
% 0.10/0.24 % -------------------------------------------------
% 0.10/0.24 % User time : 0.005 s
% 0.10/0.24 % System time : 0.007 s
% 0.10/0.24 % Total time : 0.011 s
% 0.10/0.24 % Maximum resident set size: 4864 pages
% 0.10/0.24 % E exiting
%------------------------------------------------------------------------------