%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET580^3 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:21:57 AM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 81 ( 2 equ; 0 cnn)
% Maximal formula atoms : 48 ( 4 avg)
% Number of connectives : 223 ( 47 ~; 55 |; 17 &; 98 @)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 15 ( 6 ^; 9 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_29,type,
excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_37,type,
epred1_0: $i > $o ).
thf(decl_38,type,
epred2_0: $i > $o ).
thf(decl_39,type,
esk1_0: $i ).
thf(thm,conjecture,
! [X22: $i > $o,X23: $i > $o,X4: $i] :
( ( excl_union @ X22 @ X23 @ X4 )
<=> ( ( X22 @ X4 )
<=> ~ ( X23 @ X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.sjgjnv6APO/E---3.1_718745.p',thm) ).
thf(excl_union,axiom,
( excl_union
= ( ^ [X7: $i > $o,X8: $i > $o,X4: $i] :
( ( ( X7 @ X4 )
& ~ ( X8 @ X4 ) )
| ( ~ ( X7 @ X4 )
& ( X8 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.sjgjnv6APO/E---3.1_718745.p',excl_union) ).
thf(c_0_2,negated_conjecture,
~ ! [X22: $i > $o,X23: $i > $o,X4: $i] :
( ( excl_union @ X22 @ X23 @ X4 )
<=> ( ( X22 @ X4 )
<=> ~ ( X23 @ X4 ) ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_3,plain,
( excl_union
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( ( Z0 @ Z2 )
& ~ ( Z1 @ Z2 ) )
| ( ~ ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[excl_union]) ).
thf(c_0_4,negated_conjecture,
~ ! [X22: $i > $o,X23: $i > $o,X4: $i] :
( ( ( ( X22 @ X4 )
& ~ ( X23 @ X4 ) )
| ( ~ ( X22 @ X4 )
& ( X23 @ X4 ) ) )
<=> ( ( X22 @ X4 )
<=> ~ ( X23 @ X4 ) ) ),
inference(apply_def,[status(thm)],[c_0_2,c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ 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_4])])])])]) ).
thf(c_0_6,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_12,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
epred1_0 @ esk1_0,
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_14,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_11]) ).
thf(c_0_15,negated_conjecture,
epred2_0 @ esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET580^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n006.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 13:37:39 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running higher-order theorem proving
% 0.09/0.23 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.sjgjnv6APO/E---3.1_718745.p
% 0.09/0.25 % Version: 3.5.1-ho
% 0.09/0.25 % Preprocessing class: HSSSSMSSMLSNHSA.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.25 % Starting sh5l with 300s (1) cores
% 0.09/0.25 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.25 % Starting new_bool_2 with 300s (1) cores
% 0.09/0.25 % sh5l with pid 718759 completed with status 0
% 0.09/0.25 % Result found by sh5l
% 0.09/0.25 % Preprocessing class: HSSSSMSSMLSNHSA.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.25 % Starting sh5l with 300s (1) cores
% 0.09/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.25 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.25 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.09/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.25 % SubtermCWHack with pid 718762 completed with status 0
% 0.09/0.25 % Result found by SubtermCWHack
% 0.09/0.25 % Preprocessing class: HSSSSMSSMLSNHSA.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.25 % Starting sh5l with 300s (1) cores
% 0.09/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.25 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.25 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.09/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.25 % Preprocessing time : 0.001 s
% 0.09/0.25
% 0.09/0.25 % Proof found!
% 0.09/0.25 % SZS status Theorem
% 0.09/0.25 % SZS output start CNFRefutation
% See solution above
% 0.09/0.25 % Parsed axioms : 29
% 0.09/0.25 % Removed by relevancy pruning/SinE : 27
% 0.09/0.25 % Initial clauses : 12
% 0.09/0.25 % Removed in clause preprocessing : 8
% 0.09/0.25 % Initial clauses in saturation : 4
% 0.09/0.25 % Processed clauses : 4
% 0.09/0.25 % ...of these trivial : 0
% 0.09/0.25 % ...subsumed : 0
% 0.09/0.25 % ...remaining for further processing : 3
% 0.09/0.25 % Other redundant clauses eliminated : 0
% 0.09/0.25 % Clauses deleted for lack of memory : 0
% 0.09/0.25 % Backward-subsumed : 0
% 0.09/0.25 % Backward-rewritten : 1
% 0.09/0.25 % Generated clauses : 0
% 0.09/0.25 % ...of the previous two non-redundant : 0
% 0.09/0.25 % ...aggressively subsumed : 0
% 0.09/0.25 % Contextual simplify-reflections : 1
% 0.09/0.25 % Paramodulations : 0
% 0.09/0.25 % Factorizations : 0
% 0.09/0.25 % NegExts : 0
% 0.09/0.25 % Equation resolutions : 0
% 0.09/0.25 % Disequality decompositions : 0
% 0.09/0.25 % Total rewrite steps : 4
% 0.09/0.25 % ...of those cached : 2
% 0.09/0.25 % Propositional unsat checks : 0
% 0.09/0.25 % Propositional check models : 0
% 0.09/0.25 % Propositional check unsatisfiable : 0
% 0.09/0.25 % Propositional clauses : 0
% 0.09/0.25 % Propositional clauses after purity: 0
% 0.09/0.25 % Propositional unsat core size : 0
% 0.09/0.25 % Propositional preprocessing time : 0.000
% 0.09/0.25 % Propositional encoding time : 0.000
% 0.09/0.25 % Propositional solver time : 0.000
% 0.09/0.25 % Success case prop preproc time : 0.000
% 0.09/0.25 % Success case prop encoding time : 0.000
% 0.09/0.25 % Success case prop solver time : 0.000
% 0.09/0.25 % Current number of processed clauses : 2
% 0.09/0.25 % Positive orientable unit clauses : 2
% 0.09/0.25 % Positive unorientable unit clauses: 0
% 0.09/0.25 % Negative unit clauses : 0
% 0.09/0.25 % Non-unit-clauses : 0
% 0.09/0.25 % Current number of unprocessed clauses: 0
% 0.09/0.25 % ...number of literals in the above : 0
% 0.09/0.25 % Current number of archived formulas : 0
% 0.09/0.25 % Current number of archived clauses : 1
% 0.09/0.25 % Clause-clause subsumption calls (NU) : 1
% 0.09/0.25 % Rec. Clause-clause subsumption calls : 1
% 0.09/0.25 % Non-unit clause-clause subsumptions : 1
% 0.09/0.25 % Unit Clause-clause subsumption calls : 0
% 0.09/0.25 % Rewrite failures with RHS unbound : 0
% 0.09/0.25 % BW rewrite match attempts : 1
% 0.09/0.25 % BW rewrite match successes : 1
% 0.09/0.25 % Condensation attempts : 0
% 0.09/0.25 % Condensation successes : 0
% 0.09/0.25 % Termbank termtop insertions : 929
% 0.09/0.25 % Search garbage collected termcells : 276
% 0.09/0.25
% 0.09/0.25 % -------------------------------------------------
% 0.09/0.25 % User time : 0.001 s
% 0.09/0.25 % System time : 0.003 s
% 0.09/0.25 % Total time : 0.004 s
% 0.09/0.25 % Maximum resident set size: 3656 pages
% 0.09/0.25
% 0.09/0.25 % -------------------------------------------------
% 0.09/0.25 % User time : 0.004 s
% 0.09/0.25 % System time : 0.007 s
% 0.09/0.25 % Total time : 0.011 s
% 0.09/0.25 % Maximum resident set size: 4864 pages
% 0.09/0.25 % E exiting
%------------------------------------------------------------------------------