%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU648^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:52 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 29 ( 25 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 207 ( 7 ~; 3 |; 2 &; 186 @)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 38 ( 2 ^; 36 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
setadjoin: $i > $i > $i ).
thf(decl_25,type,
kpair: $i > $i > $i ).
thf(decl_26,type,
setukpairinjL2: $o ).
thf(decl_27,type,
esk1_0: $i ).
thf(decl_28,type,
esk2_0: $i ).
thf(decl_29,type,
esk3_0: $i ).
thf(decl_30,type,
esk4_0: $i ).
thf(setukpairinjL,conjecture,
( setukpairinjL2
=> ! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( ( kpair @ X1 @ X2 )
= ( kpair @ X3 @ X4 ) )
=> ( X1 = X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1pKjns1ydp/E---3.1_819416.p',setukpairinjL) ).
thf(setukpairinjL2,axiom,
( setukpairinjL2
<=> ! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) ) @ emptyset ) ) )
=> ( X1 = X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1pKjns1ydp/E---3.1_819416.p',setukpairinjL2) ).
thf(kpair,axiom,
( kpair
= ( ^ [X1: $i,X2: $i] : ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1pKjns1ydp/E---3.1_819416.p',kpair) ).
thf(c_0_3,negated_conjecture,
~ ( setukpairinjL2
=> ! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( ( kpair @ X1 @ X2 )
= ( kpair @ X3 @ X4 ) )
=> ( X1 = X3 ) ) ),
inference(assume_negation,[status(cth)],[setukpairinjL]) ).
thf(c_0_4,negated_conjecture,
~ ( ! [X13: $i,X14: $i,X15: $i,X16: $i] :
( ( ( setadjoin @ ( setadjoin @ X13 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X13 @ ( setadjoin @ X14 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X15 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X15 @ ( setadjoin @ X16 @ emptyset ) ) @ emptyset ) ) )
=> ( X13 = X15 ) )
=> ! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( ( kpair @ X1 @ X2 )
= ( kpair @ X3 @ X4 ) )
=> ( X1 = X3 ) ) ),
inference(apply_def,[status(thm)],[c_0_3,setukpairinjL2]) ).
thf(c_0_5,plain,
! [X17: $i,X18: $i] :
( ( kpair @ X17 @ X18 )
= ( setadjoin @ ( setadjoin @ X17 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X17 @ ( setadjoin @ X18 @ emptyset ) ) @ emptyset ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[kpair])]) ).
thf(c_0_6,negated_conjecture,
! [X21: $i,X22: $i,X23: $i,X24: $i] :
( ( ( ( setadjoin @ ( setadjoin @ X21 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X21 @ ( setadjoin @ X22 @ emptyset ) ) @ emptyset ) )
!= ( setadjoin @ ( setadjoin @ X23 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X23 @ ( setadjoin @ X24 @ emptyset ) ) @ emptyset ) ) )
| ( X21 = X23 ) )
& ( ( kpair @ esk1_0 @ esk2_0 )
= ( kpair @ esk3_0 @ esk4_0 ) )
& ( 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_4])])])])]) ).
thf(c_0_7,plain,
! [X19: $i,X20: $i] :
( ( kpair @ X19 @ X20 )
= ( setadjoin @ ( setadjoin @ X19 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X19 @ ( setadjoin @ X20 @ emptyset ) ) @ emptyset ) ) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
( ( kpair @ esk1_0 @ esk2_0 )
= ( kpair @ esk3_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X1: $i,X2: $i] :
( ( kpair @ X1 @ X2 )
= ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( X1 = X3 )
| ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) )
!= ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) ) @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
( ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ esk3_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk3_0 @ ( setadjoin @ esk4_0 @ emptyset ) ) @ emptyset ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i] :
( ( X1 = esk1_0 )
| ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) )
!= ( setadjoin @ ( setadjoin @ esk3_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk3_0 @ ( setadjoin @ esk4_0 @ emptyset ) ) @ emptyset ) ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_13,negated_conjecture,
esk1_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU648^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n019.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 14:02:32 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/0.23 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.1pKjns1ydp/E---3.1_819416.p
% 0.10/0.25 % Version: 3.5.1-ho
% 0.10/0.25 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.10/0.25 % Starting post_as_ho5 with 300s (1) cores
% 0.10/0.25 % Starting sh4l with 300s (1) cores
% 0.10/0.25 % Starting ho_unfolding_2 with 300s (1) cores
% 0.10/0.25 % ho_unfolding_3 with pid 819429 completed with status 0
% 0.10/0.25 % Result found by ho_unfolding_3
% 0.10/0.25 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.10/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HHUPF-FFSF22-MSFFMFNN
% 0.10/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.25 % Starting ho_unfolding_3 with 151s (1) cores
% 0.10/0.25 % Starting sh5l with 136s (1) cores
% 0.10/0.25 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.25 % Starting new_bool_2 with 136s (1) cores
% 0.10/0.25 % ho_unfolding_3 with pid 819434 completed with status 0
% 0.10/0.25 % Result found by ho_unfolding_3
% 0.10/0.25 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.10/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HHUPF-FFSF22-MSFFMFNN
% 0.10/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.25 % Starting ho_unfolding_3 with 151s (1) cores
% 0.10/0.25 % Preprocessing time : 0.001 s
% 0.10/0.25 % Presaturation interreduction done
% 0.10/0.25
% 0.10/0.25 % Proof found!
% 0.10/0.25 % SZS status Theorem
% 0.10/0.25 % SZS output start CNFRefutation
% See solution above
% 0.10/0.25 % Parsed axioms : 7
% 0.10/0.25 % Removed by relevancy pruning/SinE : 0
% 0.10/0.25 % Initial clauses : 8
% 0.10/0.25 % Removed in clause preprocessing : 4
% 0.10/0.25 % Initial clauses in saturation : 4
% 0.10/0.25 % Processed clauses : 10
% 0.10/0.25 % ...of these trivial : 0
% 0.10/0.25 % ...subsumed : 0
% 0.10/0.25 % ...remaining for further processing : 10
% 0.10/0.25 % Other redundant clauses eliminated : 0
% 0.10/0.25 % Clauses deleted for lack of memory : 0
% 0.10/0.25 % Backward-subsumed : 0
% 0.10/0.25 % Backward-rewritten : 1
% 0.10/0.25 % Generated clauses : 7
% 0.10/0.25 % ...of the previous two non-redundant : 5
% 0.10/0.25 % ...aggressively subsumed : 0
% 0.10/0.25 % Contextual simplify-reflections : 0
% 0.10/0.25 % Paramodulations : 5
% 0.10/0.25 % Factorizations : 0
% 0.10/0.25 % NegExts : 0
% 0.10/0.25 % Equation resolutions : 2
% 0.10/0.25 % Disequality decompositions : 0
% 0.10/0.25 % Total rewrite steps : 2
% 0.10/0.25 % ...of those cached : 0
% 0.10/0.25 % Propositional unsat checks : 0
% 0.10/0.25 % Propositional check models : 0
% 0.10/0.25 % Propositional check unsatisfiable : 0
% 0.10/0.25 % Propositional clauses : 0
% 0.10/0.25 % Propositional clauses after purity: 0
% 0.10/0.25 % Propositional unsat core size : 0
% 0.10/0.25 % Propositional preprocessing time : 0.000
% 0.10/0.25 % Propositional encoding time : 0.000
% 0.10/0.25 % Propositional solver time : 0.000
% 0.10/0.25 % Success case prop preproc time : 0.000
% 0.10/0.25 % Success case prop encoding time : 0.000
% 0.10/0.25 % Success case prop solver time : 0.000
% 0.10/0.25 % Current number of processed clauses : 5
% 0.10/0.25 % Positive orientable unit clauses : 2
% 0.10/0.25 % Positive unorientable unit clauses: 0
% 0.10/0.25 % Negative unit clauses : 1
% 0.10/0.25 % Non-unit-clauses : 2
% 0.10/0.25 % Current number of unprocessed clauses: 3
% 0.10/0.25 % ...number of literals in the above : 6
% 0.10/0.25 % Current number of archived formulas : 0
% 0.10/0.25 % Current number of archived clauses : 5
% 0.10/0.25 % Clause-clause subsumption calls (NU) : 1
% 0.10/0.25 % Rec. Clause-clause subsumption calls : 1
% 0.10/0.25 % Non-unit clause-clause subsumptions : 0
% 0.10/0.25 % Unit Clause-clause subsumption calls : 0
% 0.10/0.25 % Rewrite failures with RHS unbound : 0
% 0.10/0.25 % BW rewrite match attempts : 2
% 0.10/0.25 % BW rewrite match successes : 2
% 0.10/0.25 % Condensation attempts : 10
% 0.10/0.25 % Condensation successes : 0
% 0.10/0.25 % Termbank termtop insertions : 846
% 0.10/0.25 % Search garbage collected termcells : 137
% 0.10/0.25
% 0.10/0.25 % -------------------------------------------------
% 0.10/0.25 % User time : 0.003 s
% 0.10/0.25 % System time : 0.002 s
% 0.10/0.25 % Total time : 0.006 s
% 0.10/0.25 % Maximum resident set size: 3632 pages
% 0.10/0.25
% 0.10/0.25 % -------------------------------------------------
% 0.10/0.25 % User time : 0.009 s
% 0.10/0.25 % System time : 0.009 s
% 0.10/0.25 % Total time : 0.019 s
% 0.10/0.25 % Maximum resident set size: 4864 pages
% 0.10/0.25 % E exiting
%------------------------------------------------------------------------------