%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU642^2 : 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 : n005.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:24:50 AM UTC 2026
% Result : Theorem 0.06s 0.24s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 59 ( 27 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 214 ( 9 ~; 11 |; 5 &; 164 @)
% ( 4 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 43 ( 0 ^; 43 !; 0 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
emptyset: $i ).
thf(decl_25,type,
setadjoin: $i > $i > $i ).
thf(decl_26,type,
setadjoinIL: $o ).
thf(decl_27,type,
uniqinunit: $o ).
thf(decl_28,type,
upairset2E: $o ).
thf(decl_29,type,
singletonsuniq: $o ).
thf(decl_30,type,
esk1_0: $i ).
thf(decl_31,type,
esk2_0: $i ).
thf(decl_32,type,
esk3_0: $i ).
thf(setukpairinjL1,conjecture,
( setadjoinIL
=> ( uniqinunit
=> ( upairset2E
=> ( singletonsuniq
=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
=> ( X1 = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.S9YXwah5G2/E---3.1_1715343.p',setukpairinjL1) ).
thf(uniqinunit,axiom,
( uniqinunit
<=> ! [X1: $i,X2: $i] :
( ( in @ X1 @ ( setadjoin @ X2 @ emptyset ) )
=> ( X1 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.S9YXwah5G2/E---3.1_1715343.p',uniqinunit) ).
thf(setadjoinIL,axiom,
( setadjoinIL
<=> ! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.S9YXwah5G2/E---3.1_1715343.p',setadjoinIL) ).
thf(upairset2E,axiom,
( upairset2E
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
=> ( ( X3 = X1 )
| ( X3 = X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.S9YXwah5G2/E---3.1_1715343.p',upairset2E) ).
thf(singletonsuniq,axiom,
( singletonsuniq
<=> ! [X1: $i,X2: $i] :
( ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ emptyset ) )
=> ( X1 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.S9YXwah5G2/E---3.1_1715343.p',singletonsuniq) ).
thf(c_0_5,negated_conjecture,
~ ( setadjoinIL
=> ( uniqinunit
=> ( upairset2E
=> ( singletonsuniq
=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
=> ( X1 = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[setukpairinjL1]) ).
thf(c_0_6,negated_conjecture,
~ ( ! [X16: $i,X17: $i] : ( in @ X16 @ ( setadjoin @ X16 @ X17 ) )
=> ( ! [X18: $i,X19: $i] :
( ( in @ X18 @ ( setadjoin @ X19 @ emptyset ) )
=> ( X18 = X19 ) )
=> ( ! [X20: $i,X21: $i,X22: $i] :
( ( in @ X22 @ ( setadjoin @ X20 @ ( setadjoin @ X21 @ emptyset ) ) )
=> ( ( X22 = X20 )
| ( X22 = X21 ) ) )
=> ( ! [X23: $i,X24: $i] :
( ( ( setadjoin @ X23 @ emptyset )
= ( setadjoin @ X24 @ emptyset ) )
=> ( X23 = X24 ) )
=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
=> ( X1 = X3 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,uniqinunit]),setadjoinIL]),upairset2E]),singletonsuniq]) ).
thf(c_0_7,negated_conjecture,
! [X25: $i,X26: $i,X27: $i,X28: $i,X29: $i,X30: $i,X31: $i,X32: $i,X33: $i] :
( ( in @ X25 @ ( setadjoin @ X25 @ X26 ) )
& ( ~ ( in @ X27 @ ( setadjoin @ X28 @ emptyset ) )
| ( X27 = X28 ) )
& ( ~ ( in @ X31 @ ( setadjoin @ X29 @ ( setadjoin @ X30 @ emptyset ) ) )
| ( X31 = X29 )
| ( X31 = X30 ) )
& ( ( ( setadjoin @ X32 @ emptyset )
!= ( setadjoin @ X33 @ emptyset ) )
| ( X32 = X33 ) )
& ( in @ ( setadjoin @ esk3_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) ) )
& ( esk1_0 != esk3_0 ) ),
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_6])])])])]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( X1 = X2 )
| ( X1 = X3 )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
in @ ( setadjoin @ esk3_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) )
= ( setadjoin @ esk3_0 @ emptyset ) )
| ( ( setadjoin @ esk3_0 @ emptyset )
= ( setadjoin @ esk1_0 @ emptyset ) ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_13,negated_conjecture,
( ( ( setadjoin @ esk3_0 @ emptyset )
= ( setadjoin @ esk1_0 @ emptyset ) )
| ( in @ esk1_0 @ ( setadjoin @ esk3_0 @ emptyset ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
esk1_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_15,negated_conjecture,
( ( setadjoin @ esk3_0 @ emptyset )
= ( setadjoin @ esk1_0 @ emptyset ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_16,negated_conjecture,
in @ esk3_0 @ ( setadjoin @ esk1_0 @ emptyset ),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_16]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU642^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.16 % Computer : n005.cluster.edu
% 0.06/0.16 % Model : x86_64 x86_64
% 0.06/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.16 % Memory : 8046.5625MB
% 0.06/0.16 % OS : Linux 6.8.0-71-generic
% 0.06/0.16 % CPULimit : 300
% 0.06/0.16 % WCLimit : 300
% 0.06/0.16 % DateTime : Tue Sep 29 14:01:46 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.21 Running higher-order theorem proving
% 0.06/0.22 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.S9YXwah5G2/E---3.1_1715343.p
% 0.06/0.24 % Version: 3.5.1-ho
% 0.06/0.24 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.06/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.24 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.06/0.24 % Starting post_as_ho8 with 300s (1) cores
% 0.06/0.24 % Starting post_as_ho3 with 300s (1) cores
% 0.06/0.24 % Starting post_as_ho2 with 300s (1) cores
% 0.06/0.24 % post_as_ho8 with pid 1715357 completed with status 0
% 0.06/0.24 % Result found by post_as_ho8
% 0.06/0.24 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.06/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.24 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.06/0.24 % Starting post_as_ho8 with 300s (1) cores
% 0.06/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.06/0.24 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.06/0.24 % Search class: HGUSF-FFSF22-MFFFMFNN
% 0.06/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.06/0.24 % SubtermCWHack with pid 1715362 completed with status 0
% 0.06/0.24 % Result found by SubtermCWHack
% 0.06/0.24 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.06/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.24 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.06/0.24 % Starting post_as_ho8 with 300s (1) cores
% 0.06/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.06/0.24 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.06/0.24 % Search class: HGUSF-FFSF22-MFFFMFNN
% 0.06/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.06/0.24 % Preprocessing time : 0.001 s
% 0.06/0.24
% 0.06/0.24 % Proof found!
% 0.06/0.24 % SZS status Theorem
% 0.06/0.24 % SZS output start CNFRefutation
% See solution above
% 0.06/0.24 % Parsed axioms : 12
% 0.06/0.24 % Removed by relevancy pruning/SinE : 7
% 0.06/0.24 % Initial clauses : 6
% 0.06/0.24 % Removed in clause preprocessing : 0
% 0.06/0.24 % Initial clauses in saturation : 6
% 0.06/0.24 % Processed clauses : 10
% 0.06/0.24 % ...of these trivial : 0
% 0.06/0.24 % ...subsumed : 0
% 0.06/0.24 % ...remaining for further processing : 10
% 0.06/0.24 % Other redundant clauses eliminated : 0
% 0.06/0.24 % Clauses deleted for lack of memory : 0
% 0.06/0.24 % Backward-subsumed : 0
% 0.06/0.24 % Backward-rewritten : 3
% 0.06/0.24 % Generated clauses : 12
% 0.06/0.24 % ...of the previous two non-redundant : 10
% 0.06/0.24 % ...aggressively subsumed : 0
% 0.06/0.24 % Contextual simplify-reflections : 0
% 0.06/0.24 % Paramodulations : 11
% 0.06/0.24 % Factorizations : 0
% 0.06/0.24 % NegExts : 0
% 0.06/0.24 % Equation resolutions : 1
% 0.06/0.24 % Disequality decompositions : 0
% 0.06/0.24 % Total rewrite steps : 7
% 0.06/0.24 % ...of those cached : 4
% 0.06/0.24 % Propositional unsat checks : 0
% 0.06/0.24 % Propositional check models : 0
% 0.06/0.24 % Propositional check unsatisfiable : 0
% 0.06/0.24 % Propositional clauses : 0
% 0.06/0.24 % Propositional clauses after purity: 0
% 0.06/0.24 % Propositional unsat core size : 0
% 0.06/0.24 % Propositional preprocessing time : 0.000
% 0.06/0.24 % Propositional encoding time : 0.000
% 0.06/0.24 % Propositional solver time : 0.000
% 0.06/0.24 % Success case prop preproc time : 0.000
% 0.06/0.24 % Success case prop encoding time : 0.000
% 0.06/0.24 % Success case prop solver time : 0.000
% 0.06/0.24 % Current number of processed clauses : 7
% 0.06/0.24 % Positive orientable unit clauses : 3
% 0.06/0.24 % Positive unorientable unit clauses: 0
% 0.06/0.24 % Negative unit clauses : 1
% 0.06/0.24 % Non-unit-clauses : 3
% 0.06/0.24 % Current number of unprocessed clauses: 6
% 0.06/0.24 % ...number of literals in the above : 15
% 0.06/0.24 % Current number of archived formulas : 0
% 0.06/0.24 % Current number of archived clauses : 3
% 0.06/0.24 % Clause-clause subsumption calls (NU) : 7
% 0.06/0.24 % Rec. Clause-clause subsumption calls : 7
% 0.06/0.24 % Non-unit clause-clause subsumptions : 0
% 0.06/0.24 % Unit Clause-clause subsumption calls : 0
% 0.06/0.24 % Rewrite failures with RHS unbound : 0
% 0.06/0.24 % BW rewrite match attempts : 1
% 0.06/0.24 % BW rewrite match successes : 1
% 0.06/0.24 % Condensation attempts : 0
% 0.06/0.24 % Condensation successes : 0
% 0.06/0.24 % Termbank termtop insertions : 869
% 0.06/0.24 % Search garbage collected termcells : 266
% 0.06/0.24
% 0.06/0.24 % -------------------------------------------------
% 0.06/0.24 % User time : 0.002 s
% 0.06/0.24 % System time : 0.002 s
% 0.06/0.24 % Total time : 0.004 s
% 0.06/0.24 % Maximum resident set size: 3892 pages
% 0.06/0.24
% 0.06/0.24 % -------------------------------------------------
% 0.06/0.24 % User time : 0.003 s
% 0.06/0.24 % System time : 0.007 s
% 0.06/0.24 % Total time : 0.010 s
% 0.06/0.24 % Maximum resident set size: 4864 pages
% 0.06/0.24 % E exiting
%------------------------------------------------------------------------------