%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU826^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:27:57 AM UTC 2026
% Result : Theorem 0.09s 0.24s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 114 ( 6 equ; 0 cnn)
% Maximal formula atoms : 44 ( 5 avg)
% Number of connectives : 220 ( 40 ~; 51 |; 15 &; 111 @)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 19 ( 16 ^; 3 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
seteq: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_24,type,
u: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_25,type,
n: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_26,type,
a: $i > $o ).
thf(decl_27,type,
b: $i > $o ).
thf(decl_28,type,
c: $i > $o ).
thf(decl_29,type,
esk1_0: $i ).
thf(conj,conjecture,
seteq @ ( u @ a @ ( n @ b @ c ) ) @ ( n @ ( u @ a @ b ) @ ( u @ a @ c ) ),
file('/export/starexec/sandbox/tmp/tmp.3eW6kQqkUq/E---3.1_171282.p',conj) ).
thf(u,axiom,
( u
= ( ^ [X1: $i > $o,X2: $i > $o,X3: $i] :
( ( X1 @ X3 )
| ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3eW6kQqkUq/E---3.1_171282.p',u) ).
thf(n,axiom,
( n
= ( ^ [X1: $i > $o,X2: $i > $o,X3: $i] :
( ( X1 @ X3 )
& ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3eW6kQqkUq/E---3.1_171282.p',n) ).
thf(seteq,axiom,
( seteq
= ( ^ [X1: $i > $o,X2: $i > $o] :
! [X3: $i] :
( ( X1 @ X3 )
<=> ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3eW6kQqkUq/E---3.1_171282.p',seteq) ).
thf(c_0_4,negated_conjecture,
~ ( seteq @ ( u @ a @ ( n @ b @ c ) ) @ ( n @ ( u @ a @ b ) @ ( u @ a @ c ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_5,plain,
( u
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[u]) ).
thf(c_0_6,plain,
( n
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[n]) ).
thf(c_0_7,plain,
( seteq
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X3: $i] :
( ( Z0 @ X3 )
<=> ( Z1 @ X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[seteq]) ).
thf(c_0_8,negated_conjecture,
~ ! [X4: $i] :
( ( ( a @ X4 )
| ( ( b @ X4 )
& ( c @ X4 ) ) )
<=> ( ( ( a @ X4 )
| ( b @ X4 ) )
& ( ( a @ X4 )
| ( c @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_4,c_0_5]),c_0_6]),c_0_7]) ).
thf(c_0_9,negated_conjecture,
( ( ~ ( a @ esk1_0 )
| ~ ( a @ esk1_0 )
| ~ ( a @ esk1_0 ) )
& ( ~ ( c @ esk1_0 )
| ~ ( a @ esk1_0 )
| ~ ( a @ esk1_0 ) )
& ( ~ ( a @ esk1_0 )
| ~ ( b @ esk1_0 )
| ~ ( a @ esk1_0 ) )
& ( ~ ( c @ esk1_0 )
| ~ ( b @ esk1_0 )
| ~ ( a @ esk1_0 ) )
& ( ~ ( a @ esk1_0 )
| ~ ( a @ esk1_0 )
| ~ ( b @ esk1_0 )
| ~ ( c @ esk1_0 ) )
& ( ~ ( c @ esk1_0 )
| ~ ( a @ esk1_0 )
| ~ ( b @ esk1_0 )
| ~ ( c @ esk1_0 ) )
& ( ~ ( a @ esk1_0 )
| ~ ( b @ esk1_0 )
| ~ ( b @ esk1_0 )
| ~ ( c @ esk1_0 ) )
& ( ~ ( c @ esk1_0 )
| ~ ( b @ esk1_0 )
| ~ ( b @ esk1_0 )
| ~ ( c @ esk1_0 ) )
& ( ( a @ esk1_0 )
| ( b @ esk1_0 )
| ( b @ esk1_0 )
| ( a @ esk1_0 ) )
& ( ( a @ esk1_0 )
| ( c @ esk1_0 )
| ( b @ esk1_0 )
| ( a @ esk1_0 ) )
& ( ( a @ esk1_0 )
| ( b @ esk1_0 )
| ( c @ esk1_0 )
| ( a @ esk1_0 ) )
& ( ( a @ esk1_0 )
| ( c @ esk1_0 )
| ( c @ esk1_0 )
| ( a @ 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_8])])])])]) ).
thf(c_0_10,negated_conjecture,
( ( a @ esk1_0 )
| ( b @ esk1_0 )
| ( b @ esk1_0 )
| ( a @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_11,negated_conjecture,
( ~ ( a @ esk1_0 )
| ~ ( a @ esk1_0 )
| ~ ( a @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
( ( a @ esk1_0 )
| ( c @ esk1_0 )
| ( c @ esk1_0 )
| ( a @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
( ~ ( c @ esk1_0 )
| ~ ( b @ esk1_0 )
| ~ ( b @ esk1_0 )
| ~ ( c @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
( ( a @ esk1_0 )
| ( b @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_10]) ).
thf(c_0_15,negated_conjecture,
~ ( a @ esk1_0 ),
inference(cn,[status(thm)],[c_0_11]) ).
thf(c_0_16,negated_conjecture,
( ( a @ esk1_0 )
| ( c @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_12]) ).
thf(c_0_17,negated_conjecture,
( ~ ( b @ esk1_0 )
| ~ ( c @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_13]) ).
thf(c_0_18,negated_conjecture,
b @ esk1_0,
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_19,negated_conjecture,
c @ esk1_0,
inference(sr,[status(thm)],[c_0_16,c_0_15]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU826^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/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 14:35:16 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 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.3eW6kQqkUq/E---3.1_171282.p
% 0.09/0.24 % Version: 3.5.1-ho
% 0.09/0.24 % Preprocessing class: HSSSSMSSSLSNHSN.
% 0.09/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.24 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.09/0.24 % Starting lpo8_lambda_fix with 300s (1) cores
% 0.09/0.24 % Starting lpo8_s with 300s (1) cores
% 0.09/0.24 % Starting new_bool_11 with 300s (1) cores
% 0.09/0.24 % lpo8_s with pid 171297 completed with status 0
% 0.09/0.24 % Result found by lpo8_s
% 0.09/0.24 % Preprocessing class: HSSSSMSSSLSNHSN.
% 0.09/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.24 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.09/0.24 % Starting lpo8_lambda_fix with 300s (1) cores
% 0.09/0.24 % Starting lpo8_s with 300s (1) cores
% 0.09/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,4.0,,6,20000,1.0))
% 0.09/0.24 % SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.09/0.24 % Search class: HGHNF-FFSS00-SHSFMFNN
% 0.09/0.24 % partial match(1): HGHNF-FFSS00-SHSSMFNN
% 0.09/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.24 % SubtermCWHack with pid 171300 completed with status 0
% 0.09/0.24 % Result found by SubtermCWHack
% 0.09/0.24 % Preprocessing class: HSSSSMSSSLSNHSN.
% 0.09/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.24 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.09/0.24 % Starting lpo8_lambda_fix with 300s (1) cores
% 0.09/0.24 % Starting lpo8_s with 300s (1) cores
% 0.09/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,4.0,,6,20000,1.0))
% 0.09/0.24 % SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.09/0.24 % Search class: HGHNF-FFSS00-SHSFMFNN
% 0.09/0.24 % partial match(1): HGHNF-FFSS00-SHSSMFNN
% 0.09/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.24 % Starting SubtermCWHack with 28s (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 : 10
% 0.09/0.24 % Removed by relevancy pruning/SinE : 6
% 0.09/0.24 % Initial clauses : 12
% 0.09/0.24 % Removed in clause preprocessing : 0
% 0.09/0.24 % Initial clauses in saturation : 12
% 0.09/0.24 % Processed clauses : 6
% 0.09/0.24 % ...of these trivial : 0
% 0.09/0.24 % ...subsumed : 2
% 0.09/0.24 % ...remaining for further processing : 3
% 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 : 0
% 0.09/0.24 % Backward-rewritten : 0
% 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 : 0
% 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 : 4
% 0.09/0.24 % ...of those cached : 2
% 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 : 2
% 0.09/0.24 % Positive unorientable unit clauses: 0
% 0.09/0.24 % Negative unit clauses : 1
% 0.09/0.24 % Non-unit-clauses : 0
% 0.09/0.24 % Current number of unprocessed clauses: 6
% 0.09/0.24 % ...number of literals in the above : 18
% 0.09/0.24 % Current number of archived formulas : 0
% 0.09/0.24 % Current number of archived clauses : 0
% 0.09/0.24 % Clause-clause subsumption calls (NU) : 0
% 0.09/0.24 % Rec. Clause-clause subsumption calls : 0
% 0.09/0.24 % Non-unit clause-clause subsumptions : 0
% 0.09/0.24 % Unit Clause-clause subsumption calls : 0
% 0.09/0.24 % Rewrite failures with RHS unbound : 0
% 0.09/0.24 % BW rewrite match attempts : 0
% 0.09/0.24 % BW rewrite match successes : 0
% 0.09/0.24 % Condensation attempts : 0
% 0.09/0.24 % Condensation successes : 0
% 0.09/0.24 % Termbank termtop insertions : 842
% 0.09/0.25 % Search garbage collected termcells : 179
% 0.09/0.25
% 0.09/0.25 % -------------------------------------------------
% 0.09/0.25 % User time : 0.003 s
% 0.09/0.25 % System time : 0.001 s
% 0.09/0.25 % Total time : 0.004 s
% 0.09/0.25 % Maximum resident set size: 3632 pages
% 0.09/0.25
% 0.09/0.25 % -------------------------------------------------
% 0.09/0.25 % User time : 0.005 s
% 0.09/0.25 % System time : 0.003 s
% 0.09/0.25 % Total time : 0.007 s
% 0.09/0.25 % Maximum resident set size: 4864 pages
% 0.09/0.25 % E exiting
%------------------------------------------------------------------------------