%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU158+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n016.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 0.44s 1.30s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 4 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 52 ( 24 ~; 21 |; 3 &)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 4 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 26 ( 0 sgn 22 !; 4 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,conjecture,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_zfmisc_1) ).
fof(f5,negated_conjecture,
~ ! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f9,plain,
? [X0,X1] :
( subset(singleton(X0),X1)
<~> in(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f10,plain,
? [X0,X1] :
( ( subset(singleton(X0),X1)
| in(X0,X1) )
& ( ~ subset(singleton(X0),X1)
| ~ in(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f11,plain,
( ( subset(singleton(sK0),sK1)
| in(sK0,sK1) )
& ( ~ subset(singleton(sK0),sK1)
| ~ in(sK0,sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( ( ~ subset(singleton(X0),X1)
| in(X0,X1) )
& ( ~ in(X0,X1)
| subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f15,plain,
( subset(singleton(sK0),sK1)
| in(sK0,sK1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f16,plain,
( ~ subset(singleton(sK0),sK1)
| ~ in(sK0,sK1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f17,plain,
! [X0,X1] :
( ~ subset(singleton(X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
! [X0,X1] :
( ~ in(X0,X1)
| subset(singleton(X0),X1) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_51,negated_conjecture,
( ~ in(sK0,sK1)
| ~ subset(singleton(sK0),sK1) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_52,negated_conjecture,
( in(sK0,sK1)
| subset(singleton(sK0),sK1) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( in(X0,X1)
| ~ subset(singleton(X0),X1) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_59,plain,
( ~ subset(singleton(sK0),sK1)
| ~ in(sK0,sK1) ),
inference(prop_impl_just,[status(thm)],[c_51]) ).
tcf(c_60,plain,
( ~ in(sK0,sK1)
| ~ subset(singleton(sK0),sK1) ),
inference(renaming,[status(thm)],[c_59]) ).
tcf(c_61,plain,
( subset(singleton(sK0),sK1)
| in(sK0,sK1) ),
inference(prop_impl_just,[status(thm)],[c_52]) ).
tcf(c_62,plain,
( in(sK0,sK1)
| subset(singleton(sK0),sK1) ),
inference(renaming,[status(thm)],[c_61]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( ~ subset(singleton(X0),X1)
| in(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_54]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( in(X0,X1)
| ~ subset(singleton(X0),X1) ),
inference(renaming,[status(thm)],[c_63]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_53]) ).
tcf(c_89,plain,
in(sK0,sK1),
inference(forward_subsumption_resolution,[status(thm)],[c_62,c_64]) ).
tcf(c_93,plain,
~ subset(singleton(sK0),sK1),
inference(backward_subsumption_resolution,[status(thm)],[c_60,c_89]) ).
tcf(c_114,plain,
~ in(sK0,sK1),
inference(resolution,[status(thm)],[c_93,c_65]) ).
tcf(c_115,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_114,c_89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU158+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n016.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:03:42 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/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...
% 0.44/1.30 % SZS status Started for theBenchmark.p
% 0.44/1.30 % SZS status Theorem for theBenchmark.p
% 0.44/1.30
% 0.44/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.44/1.30
% 0.44/1.30 % ------ iProver source info
% 0.44/1.30
% 0.44/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 0.44/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.44/1.30 % git: non_committed_changes: false
% 0.44/1.30
% 0.44/1.30 % ------ Parsing...
% 0.44/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.44/1.30
% 0.44/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s %
% 0.44/1.30
% 0.44/1.30 % SZS status Theorem for theBenchmark.p
% 0.44/1.30
% 0.44/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.30
% 0.44/1.30
%------------------------------------------------------------------------------