%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU158+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n001.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 : Fri Sep 25 02:55:39 PM UTC 2026
% Result : Theorem 3.87s 1.32s
% Output : CNFRefutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 6 unt; 0 def)
% Number of atoms : 62 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 58 ( 27 ~; 24 |; 3 &)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 26 !; 4 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f41,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f67,conjecture,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_zfmisc_1) ).
fof(f68,negated_conjecture,
~ ! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f80,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f122,plain,
? [X0,X1] :
( subset(singleton(X0),X1)
<~> in(X0,X1) ),
inference(ennf_transformation,[],[f68]) ).
fof(f175,plain,
! [X0,X1] :
( ( ~ subset(singleton(X0),X1)
| in(X0,X1) )
& ( ~ in(X0,X1)
| subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f41]) ).
fof(f186,plain,
? [X0,X1] :
( ( subset(singleton(X0),X1)
| in(X0,X1) )
& ( ~ subset(singleton(X0),X1)
| ~ in(X0,X1) ) ),
inference(nnf_transformation,[],[f122]) ).
fof(f187,plain,
( ( subset(singleton(sK19),sK20)
| in(sK19,sK20) )
& ( ~ subset(singleton(sK19),sK20)
| ~ in(sK19,sK20) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20]),skolemize(X0,sK19),skolemize(X1,sK20)],[f186]) ).
fof(f265,plain,
! [X0,X1] :
( ~ subset(singleton(X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f175]) ).
fof(f266,plain,
! [X0,X1] :
( ~ in(X0,X1)
| subset(singleton(X0),X1) ),
inference(cnf_transformation,[],[f175]) ).
fof(f300,plain,
( subset(singleton(sK19),sK20)
| in(sK19,sK20) ),
inference(cnf_transformation,[],[f187]) ).
fof(f301,plain,
( ~ subset(singleton(sK19),sK20)
| ~ in(sK19,sK20) ),
inference(cnf_transformation,[],[f187]) ).
fof(f316,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f80]) ).
fof(f351,plain,
! [X0,X1] :
( ~ in(X0,X1)
| subset(unordered_pair(X0,X0),X1) ),
inference(definition_unfolding,[],[f266,f316]) ).
fof(f352,plain,
! [X0,X1] :
( ~ subset(unordered_pair(X0,X0),X1)
| in(X0,X1) ),
inference(definition_unfolding,[],[f265,f316]) ).
fof(f368,plain,
( ~ subset(unordered_pair(sK19,sK19),sK20)
| ~ in(sK19,sK20) ),
inference(definition_unfolding,[],[f301,f316]) ).
fof(f369,plain,
( subset(unordered_pair(sK19,sK19),sK20)
| in(sK19,sK20) ),
inference(definition_unfolding,[],[f300,f316]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] :
( subset(unordered_pair(X0,X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f351]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i] :
( in(X0,X1)
| ~ subset(unordered_pair(X0,X0),X1) ),
inference(cnf_transformation,[],[f352]) ).
tcf(c_157,negated_conjecture,
( ~ in(sK19,sK20)
| ~ subset(unordered_pair(sK19,sK19),sK20) ),
inference(cnf_transformation,[],[f368]) ).
tcf(c_158,negated_conjecture,
( in(sK19,sK20)
| subset(unordered_pair(sK19,sK19),sK20) ),
inference(cnf_transformation,[],[f369]) ).
tcf(c_258,plain,
! [X0: $i,X1: $i] :
( ~ subset(unordered_pair(X0,X0),X1)
| in(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
tcf(c_259,plain,
! [X0: $i,X1: $i] :
( in(X0,X1)
| ~ subset(unordered_pair(X0,X0),X1) ),
inference(renaming,[status(thm)],[c_258]) ).
tcf(c_266,plain,
( ~ subset(unordered_pair(sK19,sK19),sK20)
| ~ in(sK19,sK20) ),
inference(prop_impl_just,[status(thm)],[c_157]) ).
tcf(c_267,plain,
( ~ in(sK19,sK20)
| ~ subset(unordered_pair(sK19,sK19),sK20) ),
inference(renaming,[status(thm)],[c_266]) ).
tcf(c_268,plain,
( subset(unordered_pair(sK19,sK19),sK20)
| in(sK19,sK20) ),
inference(prop_impl_just,[status(thm)],[c_158]) ).
tcf(c_269,plain,
( in(sK19,sK20)
| subset(unordered_pair(sK19,sK19),sK20) ),
inference(renaming,[status(thm)],[c_268]) ).
tcf(c_723,plain,
in(sK19,sK20),
inference(forward_subsumption_resolution,[status(thm)],[c_269,c_259]) ).
tcf(c_727,plain,
~ subset(unordered_pair(sK19,sK19),sK20),
inference(backward_subsumption_resolution,[status(thm)],[c_267,c_723]) ).
tcf(c_5453,plain,
~ in(sK19,sK20),
inference(superposition,[status(thm)],[c_122,c_727]) ).
tcf(c_5457,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5453,c_723]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU158+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n001.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 13:04:52 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 3.87/1.32 % SZS status Started for theBenchmark.p
% 3.87/1.32 % SZS status Theorem for theBenchmark.p
% 3.87/1.32
% 3.87/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.87/1.32
% 3.87/1.32 % ------ iProver source info
% 3.87/1.32
% 3.87/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 3.87/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.87/1.32 % git: non_committed_changes: false
% 3.87/1.32
% 3.87/1.32 % ------ Parsing...
% 3.87/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.87/1.32
% 3.87/1.32 % ------ Preprocessing... sup_sim: 5 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.87/1.32
% 3.87/1.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.87/1.32
% 3.87/1.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.87/1.32 % ------ Proving...
% 3.87/1.32 % ------ Problem Properties
% 3.87/1.32
% 3.87/1.32 %
% 3.87/1.32 % clauses 121
% 3.87/1.32 % conjectures 0
% 3.87/1.32 % EPR 22
% 3.87/1.32 % Horn 93
% 3.87/1.32 % unary 26
% 3.87/1.32 % binary 52
% 3.87/1.32 % lits 266
% 3.87/1.32 % lits eq 78
% 3.87/1.32 % fd_pure 0
% 3.87/1.32 % fd_pseudo 0
% 3.87/1.32 % fd_cond 3
% 3.87/1.32 % fd_pseudo_cond 35
% 3.87/1.32 % AC symbols 0
% 3.87/1.32
% 3.87/1.32 % ------ Schedule dynamic 5 is on
% 3.87/1.32
% 3.87/1.32 % ------ no conjectures: strip conj schedule
% 3.87/1.32
% 3.87/1.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.87/1.32
% 3.87/1.32
% 3.87/1.32 % ------
% 3.87/1.32 % Current options:
% 3.87/1.32 % ------
% 3.87/1.32
% 3.87/1.32
% 3.87/1.32 %
% 3.87/1.32
% 3.87/1.32 % ------ Proving...
% 3.87/1.32 %
% 3.87/1.32
% 3.87/1.32 % SZS status Theorem for theBenchmark.p
% 3.87/1.32
% 3.87/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.87/1.32
% 3.87/1.32
%------------------------------------------------------------------------------