%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET067^1 : 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 : n018.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:54 AM UTC 2026
% Result : Theorem 0.07s 0.24s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 30 ( 19 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 33 ( 6 ~; 6 |; 2 &; 16 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 19 ( 10 ^; 9 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_26,type,
unord_pair: $i > $i > $i > $o ).
thf(decl_34,type,
subset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_37,type,
esk1_0: $i ).
thf(decl_38,type,
esk2_0: $i ).
thf(decl_39,type,
esk3_0: $i ).
thf(thm,conjecture,
! [X1: $i,X3: $i] : ( subset @ ( unord_pair @ X1 @ X3 ) @ ( unord_pair @ X3 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.OvPaiSiX2m/E---3.1_73254.p',thm) ).
thf(unord_pair,axiom,
( unord_pair
= ( ^ [X1: $i,X3: $i,X4: $i] :
( ( X4 = X1 )
| ( X4 = X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.OvPaiSiX2m/E---3.1_73254.p',unord_pair) ).
thf(subset,axiom,
( subset
= ( ^ [X16: $i > $o,X17: $i > $o] :
! [X4: $i] :
( ( X16 @ X4 )
=> ( X17 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.OvPaiSiX2m/E---3.1_73254.p',subset) ).
thf(c_0_3,negated_conjecture,
~ ! [X1: $i,X3: $i] : ( subset @ ( unord_pair @ X1 @ X3 ) @ ( unord_pair @ X3 @ X1 ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_4,plain,
( unord_pair
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( ( Z2 = Z0 )
| Z2 ) ) ),
inference(fof_simplification,[status(thm)],[unord_pair]) ).
thf(c_0_5,plain,
( subset
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[subset]) ).
thf(c_0_6,negated_conjecture,
~ ! [X1: $i,X3: $i,X24: $i] :
( ( ( X24 = X1 )
| ( X24 = X3 ) )
=> ( ( X24 = X3 )
| ( X24 = X1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
( ( ( esk3_0 = esk1_0 )
| ( esk3_0 = esk2_0 ) )
& ( esk3_0 != esk2_0 )
& ( esk3_0 != esk1_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
thf(c_0_8,negated_conjecture,
( ( esk3_0 = esk1_0 )
| ( esk3_0 = esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
esk3_0 != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
esk3_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET067^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.17 % Computer : n018.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 13:38:56 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running higher-order theorem proving
% 0.07/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.OvPaiSiX2m/E---3.1_73254.p
% 0.07/0.24 % Version: 3.5.1-ho
% 0.07/0.24 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.07/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.24 % Starting new_ho_9 with 1500s (5) cores
% 0.07/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.24 % Starting sh1l with 300s (1) cores
% 0.07/0.24 % Starting post_as_ho10 with 300s (1) cores
% 0.07/0.24 % post_as_ho1 with pid 73288 completed with status 0
% 0.07/0.24 % Result found by post_as_ho1
% 0.07/0.24 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.07/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.24 % Starting new_ho_9 with 1500s (5) cores
% 0.07/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.24 % No SInE strategy applied
% 0.07/0.24 % Search class: HGUPF-FFSF00-SHSSMFNN
% 0.07/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.24 % SubtermCWHack with pid 73292 completed with status 0
% 0.07/0.24 % Result found by SubtermCWHack
% 0.07/0.24 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.07/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.24 % Starting new_ho_9 with 1500s (5) cores
% 0.07/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.24 % No SInE strategy applied
% 0.07/0.24 % Search class: HGUPF-FFSF00-SHSSMFNN
% 0.07/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.24 % Preprocessing time : 0.001 s
% 0.07/0.24
% 0.07/0.24 % Proof found!
% 0.07/0.24 % SZS status Theorem
% 0.07/0.24 % SZS output start CNFRefutation
% See solution above
% 0.07/0.24 % Parsed axioms : 29
% 0.07/0.24 % Removed by relevancy pruning/SinE : 0
% 0.07/0.24 % Initial clauses : 17
% 0.07/0.24 % Removed in clause preprocessing : 14
% 0.07/0.24 % Initial clauses in saturation : 3
% 0.07/0.24 % Processed clauses : 3
% 0.07/0.24 % ...of these trivial : 0
% 0.07/0.24 % ...subsumed : 0
% 0.07/0.24 % ...remaining for further processing : 2
% 0.07/0.24 % Other redundant clauses eliminated : 0
% 0.07/0.24 % Clauses deleted for lack of memory : 0
% 0.07/0.24 % Backward-subsumed : 0
% 0.07/0.24 % Backward-rewritten : 0
% 0.07/0.24 % Generated clauses : 0
% 0.07/0.24 % ...of the previous two non-redundant : 0
% 0.07/0.24 % ...aggressively subsumed : 0
% 0.07/0.24 % Contextual simplify-reflections : 0
% 0.07/0.24 % Paramodulations : 0
% 0.07/0.24 % Factorizations : 0
% 0.07/0.24 % NegExts : 0
% 0.07/0.24 % Equation resolutions : 0
% 0.07/0.24 % Disequality decompositions : 0
% 0.07/0.24 % Total rewrite steps : 0
% 0.07/0.24 % ...of those cached : 0
% 0.07/0.24 % Propositional unsat checks : 0
% 0.07/0.24 % Propositional check models : 0
% 0.07/0.24 % Propositional check unsatisfiable : 0
% 0.07/0.24 % Propositional clauses : 0
% 0.07/0.24 % Propositional clauses after purity: 0
% 0.07/0.24 % Propositional unsat core size : 0
% 0.07/0.24 % Propositional preprocessing time : 0.000
% 0.07/0.24 % Propositional encoding time : 0.000
% 0.07/0.24 % Propositional solver time : 0.000
% 0.07/0.24 % Success case prop preproc time : 0.000
% 0.07/0.24 % Success case prop encoding time : 0.000
% 0.07/0.24 % Success case prop solver time : 0.000
% 0.07/0.24 % Current number of processed clauses : 2
% 0.07/0.24 % Positive orientable unit clauses : 0
% 0.07/0.24 % Positive unorientable unit clauses: 0
% 0.07/0.24 % Negative unit clauses : 2
% 0.07/0.24 % Non-unit-clauses : 0
% 0.07/0.24 % Current number of unprocessed clauses: 0
% 0.07/0.24 % ...number of literals in the above : 0
% 0.07/0.24 % Current number of archived formulas : 0
% 0.07/0.24 % Current number of archived clauses : 0
% 0.07/0.24 % Clause-clause subsumption calls (NU) : 0
% 0.07/0.24 % Rec. Clause-clause subsumption calls : 0
% 0.07/0.24 % Non-unit clause-clause subsumptions : 0
% 0.07/0.24 % Unit Clause-clause subsumption calls : 0
% 0.07/0.24 % Rewrite failures with RHS unbound : 0
% 0.07/0.24 % BW rewrite match attempts : 0
% 0.07/0.24 % BW rewrite match successes : 0
% 0.07/0.24 % Condensation attempts : 0
% 0.07/0.24 % Condensation successes : 0
% 0.07/0.24 % Termbank termtop insertions : 753
% 0.07/0.24 % Search garbage collected termcells : 86
% 0.07/0.24
% 0.07/0.24 % -------------------------------------------------
% 0.07/0.24 % User time : 0.005 s
% 0.07/0.24 % System time : 0.000 s
% 0.07/0.24 % Total time : 0.005 s
% 0.07/0.24 % Maximum resident set size: 3604 pages
% 0.07/0.24
% 0.07/0.24 % -------------------------------------------------
% 0.07/0.24 % User time : 0.007 s
% 0.07/0.24 % System time : 0.004 s
% 0.07/0.24 % Total time : 0.011 s
% 0.07/0.24 % Maximum resident set size: 4864 pages
% 0.07/0.24 % E exiting
%------------------------------------------------------------------------------