%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO091^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 : n011.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:42:21 AM UTC 2026
% Result : Theorem 0.09s 0.24s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 26 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 274 ( 0 equ; 0 cnn)
% Maximal formula atoms : 192 ( 10 avg)
% Number of connectives : 393 ( 133 ~; 219 |; 31 &; 0 @)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 38 ( 5 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 4 con; 0-0 aty)
% Number of variables : 6 ( 0 ^; 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
epred1_0: $o ).
thf(decl_24,type,
epred2_0: $o ).
thf(decl_25,type,
epred3_0: $o ).
thf(cTHM50Q,conjecture,
! [X1: $o,X2: $o,X3: $o] :
( ( ( X1
<=> X2 )
<=> X3 )
<=> ( X1
<=> ( X2
<=> X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QG4VzDVPea/E---3.1_304714.p',cTHM50Q) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: $o,X2: $o,X3: $o] :
( ( ( X1
<=> X2 )
<=> X3 )
<=> ( X1
<=> ( X2
<=> X3 ) ) ),
inference(assume_negation,[status(cth)],[cTHM50Q]) ).
thf(c_0_2,negated_conjecture,
( ( ~ epred2_0
| ~ epred3_0
| ~ epred1_0
| ~ epred1_0
| ~ epred2_0
| ~ epred3_0 )
& ( epred2_0
| epred3_0
| ~ epred1_0
| ~ epred1_0
| ~ epred2_0
| ~ epred3_0 )
& ( ~ epred2_0
| epred3_0
| epred1_0
| ~ epred1_0
| ~ epred2_0
| ~ epred3_0 )
& ( ~ epred3_0
| epred2_0
| epred1_0
| ~ epred1_0
| ~ epred2_0
| ~ epred3_0 )
& ( ~ epred2_0
| ~ epred3_0
| ~ epred1_0
| epred1_0
| epred2_0
| ~ epred3_0 )
& ( epred2_0
| epred3_0
| ~ epred1_0
| epred1_0
| epred2_0
| ~ epred3_0 )
& ( ~ epred2_0
| epred3_0
| epred1_0
| epred1_0
| epred2_0
| ~ epred3_0 )
& ( ~ epred3_0
| epred2_0
| epred1_0
| epred1_0
| epred2_0
| ~ epred3_0 )
& ( ~ epred2_0
| ~ epred3_0
| ~ epred1_0
| ~ epred1_0
| epred2_0
| epred3_0 )
& ( epred2_0
| epred3_0
| ~ epred1_0
| ~ epred1_0
| epred2_0
| epred3_0 )
& ( ~ epred2_0
| epred3_0
| epred1_0
| ~ epred1_0
| epred2_0
| epred3_0 )
& ( ~ epred3_0
| epred2_0
| epred1_0
| ~ epred1_0
| epred2_0
| epred3_0 )
& ( ~ epred2_0
| ~ epred3_0
| ~ epred1_0
| ~ epred2_0
| epred1_0
| epred3_0 )
& ( epred2_0
| epred3_0
| ~ epred1_0
| ~ epred2_0
| epred1_0
| epred3_0 )
& ( ~ epred2_0
| epred3_0
| epred1_0
| ~ epred2_0
| epred1_0
| epred3_0 )
& ( ~ epred3_0
| epred2_0
| epred1_0
| ~ epred2_0
| epred1_0
| epred3_0 )
& ( ~ epred2_0
| epred3_0
| ~ epred1_0
| ~ epred1_0
| ~ epred2_0
| epred3_0 )
& ( ~ epred3_0
| epred2_0
| ~ epred1_0
| ~ epred1_0
| ~ epred2_0
| epred3_0 )
& ( ~ epred2_0
| ~ epred3_0
| epred1_0
| ~ epred1_0
| ~ epred2_0
| epred3_0 )
& ( epred2_0
| epred3_0
| epred1_0
| ~ epred1_0
| ~ epred2_0
| epred3_0 )
& ( ~ epred2_0
| epred3_0
| ~ epred1_0
| epred1_0
| epred2_0
| epred3_0 )
& ( ~ epred3_0
| epred2_0
| ~ epred1_0
| epred1_0
| epred2_0
| epred3_0 )
& ( ~ epred2_0
| ~ epred3_0
| epred1_0
| epred1_0
| epred2_0
| epred3_0 )
& ( epred2_0
| epred3_0
| epred1_0
| epred1_0
| epred2_0
| epred3_0 )
& ( ~ epred2_0
| epred3_0
| ~ epred1_0
| ~ epred1_0
| epred2_0
| ~ epred3_0 )
& ( ~ epred3_0
| epred2_0
| ~ epred1_0
| ~ epred1_0
| epred2_0
| ~ epred3_0 )
& ( ~ epred2_0
| ~ epred3_0
| epred1_0
| ~ epred1_0
| epred2_0
| ~ epred3_0 )
& ( epred2_0
| epred3_0
| epred1_0
| ~ epred1_0
| epred2_0
| ~ epred3_0 )
& ( ~ epred2_0
| epred3_0
| ~ epred1_0
| ~ epred2_0
| epred1_0
| ~ epred3_0 )
& ( ~ epred3_0
| epred2_0
| ~ epred1_0
| ~ epred2_0
| epred1_0
| ~ epred3_0 )
& ( ~ epred2_0
| ~ epred3_0
| epred1_0
| ~ epred2_0
| epred1_0
| ~ epred3_0 )
& ( epred2_0
| epred3_0
| epred1_0
| ~ epred2_0
| epred1_0
| ~ epred3_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,
( epred2_0
| epred1_0
| epred1_0
| epred2_0
| ~ epred3_0
| ~ epred3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( epred2_0
| epred3_0
| epred1_0
| epred1_0
| epred2_0
| epred3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( epred3_0
| epred1_0
| epred1_0
| epred3_0
| ~ epred2_0
| ~ epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( epred1_0
| epred2_0
| ~ epred3_0 ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
( epred1_0
| epred2_0
| epred3_0 ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
( epred1_0
| epred1_0
| ~ epred2_0
| ~ epred3_0
| ~ epred2_0
| ~ epred3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
( epred1_0
| epred3_0
| ~ epred2_0 ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
( epred2_0
| epred1_0 ),
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_11,negated_conjecture,
( epred2_0
| epred3_0
| epred2_0
| epred3_0
| ~ epred1_0
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
( epred2_0
| epred2_0
| ~ epred3_0
| ~ epred1_0
| ~ epred1_0
| ~ epred3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
( epred1_0
| ~ epred2_0
| ~ epred3_0 ),
inference(cn,[status(thm)],[c_0_8]) ).
thf(c_0_14,negated_conjecture,
( epred3_0
| epred1_0 ),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_15,negated_conjecture,
( epred2_0
| epred3_0
| ~ epred1_0 ),
inference(cn,[status(thm)],[c_0_11]) ).
thf(c_0_16,negated_conjecture,
( epred3_0
| epred3_0
| ~ epred2_0
| ~ epred1_0
| ~ epred1_0
| ~ epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_17,negated_conjecture,
( epred2_0
| ~ epred1_0
| ~ epred3_0 ),
inference(cn,[status(thm)],[c_0_12]) ).
thf(c_0_18,negated_conjecture,
epred1_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_13,c_0_14]),c_0_10]) ).
thf(c_0_19,negated_conjecture,
( epred3_0
| epred2_0 ),
inference(csr,[status(thm)],[c_0_15,c_0_10]) ).
thf(c_0_20,negated_conjecture,
( ~ epred2_0
| ~ epred3_0
| ~ epred1_0
| ~ epred1_0
| ~ epred2_0
| ~ epred3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_21,negated_conjecture,
( epred3_0
| ~ epred1_0
| ~ epred2_0 ),
inference(cn,[status(thm)],[c_0_16]) ).
thf(c_0_22,negated_conjecture,
epred2_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),c_0_19]) ).
thf(c_0_23,negated_conjecture,
( ~ epred1_0
| ~ epred2_0
| ~ epred3_0 ),
inference(cn,[status(thm)],[c_0_20]) ).
thf(c_0_24,negated_conjecture,
epred3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_18]),c_0_22])]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_18]),c_0_22]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO091^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.17 % Computer : n011.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 16:33:31 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running higher-order theorem proving
% 0.09/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.QG4VzDVPea/E---3.1_304714.p
% 0.09/0.24 % Version: 3.5.1-ho
% 0.09/0.24 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.09/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.24 % Starting ho_unfolding_6 with 300s (1) cores
% 0.09/0.24 % Starting sh4l with 300s (1) cores
% 0.09/0.24 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.09/0.24 % ho_unfolding_6 with pid 304744 completed with status 0
% 0.09/0.24 % Result found by ho_unfolding_6
% 0.09/0.24 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.09/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.24 % Starting ho_unfolding_6 with 300s (1) cores
% 0.09/0.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.24 % No SInE strategy applied
% 0.09/0.24 % Search class: HGHNF-FFSF00-SFFFFFNN
% 0.09/0.24 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.24 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.24 % SubtermCWHack with pid 304748 completed with status 0
% 0.09/0.24 % Result found by SubtermCWHack
% 0.09/0.24 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.09/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.24 % Starting ho_unfolding_6 with 300s (1) cores
% 0.09/0.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.24 % No SInE strategy applied
% 0.09/0.24 % Search class: HGHNF-FFSF00-SFFFFFNN
% 0.09/0.24 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.24 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.24 % Preprocessing time : 0.001 s
% 0.09/0.24
% 0.09/0.24 % Proof found!
% 0.09/0.24 % SZS status Theorem
% 0.09/0.24 % SZS output start CNFRefutation
% See solution above
% 0.09/0.24 % Parsed axioms : 1
% 0.09/0.24 % Removed by relevancy pruning/SinE : 0
% 0.09/0.24 % Initial clauses : 32
% 0.09/0.24 % Removed in clause preprocessing : 24
% 0.09/0.24 % Initial clauses in saturation : 8
% 0.09/0.24 % Processed clauses : 8
% 0.09/0.24 % ...of these trivial : 0
% 0.09/0.24 % ...subsumed : 0
% 0.09/0.24 % ...remaining for further processing : 7
% 0.09/0.24 % Other redundant clauses eliminated : 0
% 0.09/0.24 % Clauses deleted for lack of memory : 0
% 0.09/0.24 % Backward-subsumed : 3
% 0.09/0.24 % Backward-rewritten : 1
% 0.09/0.24 % Generated clauses : 0
% 0.09/0.24 % ...of the previous two non-redundant : 0
% 0.09/0.24 % ...aggressively subsumed : 0
% 0.09/0.24 % Contextual simplify-reflections : 6
% 0.09/0.24 % Paramodulations : 0
% 0.09/0.24 % Factorizations : 0
% 0.09/0.24 % NegExts : 0
% 0.09/0.24 % Equation resolutions : 0
% 0.09/0.24 % Disequality decompositions : 0
% 0.09/0.24 % Total rewrite steps : 7
% 0.09/0.24 % ...of those cached : 4
% 0.09/0.24 % Propositional unsat checks : 0
% 0.09/0.24 % Propositional check models : 0
% 0.09/0.24 % Propositional check unsatisfiable : 0
% 0.09/0.24 % Propositional clauses : 0
% 0.09/0.24 % Propositional clauses after purity: 0
% 0.09/0.24 % Propositional unsat core size : 0
% 0.09/0.24 % Propositional preprocessing time : 0.000
% 0.09/0.24 % Propositional encoding time : 0.000
% 0.09/0.24 % Propositional solver time : 0.000
% 0.09/0.24 % Success case prop preproc time : 0.000
% 0.09/0.24 % Success case prop encoding time : 0.000
% 0.09/0.24 % Success case prop solver time : 0.000
% 0.09/0.24 % Current number of processed clauses : 3
% 0.09/0.24 % Positive orientable unit clauses : 3
% 0.09/0.24 % Positive unorientable unit clauses: 0
% 0.09/0.24 % Negative unit clauses : 0
% 0.09/0.24 % Non-unit-clauses : 0
% 0.09/0.24 % Current number of unprocessed clauses: 0
% 0.09/0.24 % ...number of literals in the above : 0
% 0.09/0.24 % Current number of archived formulas : 0
% 0.09/0.24 % Current number of archived clauses : 4
% 0.09/0.24 % Clause-clause subsumption calls (NU) : 7
% 0.09/0.24 % Rec. Clause-clause subsumption calls : 7
% 0.09/0.24 % Non-unit clause-clause subsumptions : 7
% 0.09/0.24 % Unit Clause-clause subsumption calls : 2
% 0.09/0.24 % Rewrite failures with RHS unbound : 0
% 0.09/0.24 % BW rewrite match attempts : 2
% 0.09/0.24 % BW rewrite match successes : 2
% 0.09/0.24 % Condensation attempts : 0
% 0.09/0.24 % Condensation successes : 0
% 0.09/0.24 % Termbank termtop insertions : 1719
% 0.09/0.24 % Search garbage collected termcells : 348
% 0.09/0.24
% 0.09/0.24 % -------------------------------------------------
% 0.09/0.24 % User time : 0.004 s
% 0.09/0.24 % System time : 0.001 s
% 0.09/0.24 % Total time : 0.005 s
% 0.09/0.24 % Maximum resident set size: 3624 pages
% 0.09/0.24
% 0.09/0.24 % -------------------------------------------------
% 0.09/0.24 % User time : 0.005 s
% 0.09/0.24 % System time : 0.006 s
% 0.09/0.24 % Total time : 0.011 s
% 0.09/0.24 % Maximum resident set size: 4608 pages
% 0.09/0.24 % E exiting
%------------------------------------------------------------------------------