%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU121+2 : 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 : n011.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:28 PM UTC 2026
% Result : Theorem 3.51s 1.30s
% Output : CNFRefutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 33 ( 9 unt; 0 def)
% Number of atoms : 84 ( 4 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 88 ( 37 ~; 32 |; 14 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 45 !; 8 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f15,conjecture,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f16,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f27,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f29,plain,
? [X0,X1,X2] :
( subset(X1,X2)
& subset(X0,X1)
& ~ subset(X0,X2) ),
inference(ennf_transformation,[],[f16]) ).
fof(f30,plain,
? [X0,X1,X2] :
( subset(X1,X2)
& subset(X0,X1)
& ~ subset(X0,X2) ),
inference(flattening,[],[f29]) ).
fof(f39,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f40,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f39]) ).
fof(f41,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK1(X0,X1),X0)
& ~ in(sK1(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f40]) ).
fof(f49,plain,
( subset(sK6,sK7)
& subset(sK5,sK6)
& ~ subset(sK5,sK7) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7)],[f30]) ).
fof(f56,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f57,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f58,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f73,plain,
subset(sK6,sK7),
inference(cnf_transformation,[],[f49]) ).
fof(f74,plain,
subset(sK5,sK6),
inference(cnf_transformation,[],[f49]) ).
fof(f75,plain,
~ subset(sK5,sK7),
inference(cnf_transformation,[],[f49]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ subset(X1,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_70,negated_conjecture,
~ subset(sK5,sK7),
inference(cnf_transformation,[],[f75]) ).
tcf(c_71,negated_conjecture,
subset(sK5,sK6),
inference(cnf_transformation,[],[f74]) ).
tcf(c_72,negated_conjecture,
subset(sK6,sK7),
inference(cnf_transformation,[],[f73]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK1(X0,X1),X1) ),
inference(prop_impl_just,[status(thm)],[c_53]) ).
tcf(c_138,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK1(X0,X1),X0) ),
inference(prop_impl_just,[status(thm)],[c_54]) ).
tcf(c_447,plain,
! [X0: $i,X1: $i] :
( in(sK1(X0,X1),X0)
| ( X1 != sK7 )
| ( X0 != sK5 ) ),
inference(resolution_lifted,[status(thm)],[c_138,c_70]) ).
tcf(c_448,plain,
in(sK1(sK5,sK7),sK5),
inference(unflattening,[status(thm)],[c_447]) ).
tcf(c_452,plain,
! [X0: $i,X1: $i] :
( ~ in(sK1(X0,X1),X1)
| ( X1 != sK7 )
| ( X0 != sK5 ) ),
inference(resolution_lifted,[status(thm)],[c_104,c_70]) ).
tcf(c_453,plain,
~ in(sK1(sK5,sK7),sK7),
inference(unflattening,[status(thm)],[c_452]) ).
tcf(c_1329,plain,
! [X0: $i] :
( in(sK1(sK5,sK7),X0)
| ~ subset(sK5,X0)
| ~ in(sK1(sK5,sK7),sK5) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_1673,plain,
( in(sK1(sK5,sK7),sK6)
| ~ subset(sK5,sK6)
| ~ in(sK1(sK5,sK7),sK5) ),
inference(instantiation,[status(thm)],[c_1329]) ).
tcf(c_1948,plain,
! [X0: $i] :
( in(sK1(sK5,sK7),X0)
| ~ subset(sK6,X0)
| ~ in(sK1(sK5,sK7),sK6) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_4420,plain,
( in(sK1(sK5,sK7),sK7)
| ~ subset(sK6,sK7)
| ~ in(sK1(sK5,sK7),sK6) ),
inference(instantiation,[status(thm)],[c_1948]) ).
tcf(c_4421,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4420,c_1673,c_453,c_448,c_71,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU121+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n011.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Thu Sep 24 12:48:27 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 3.51/1.30 % SZS status Started for theBenchmark.p
% 3.51/1.30 % SZS status Theorem for theBenchmark.p
% 3.51/1.30
% 3.51/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.51/1.30
% 3.51/1.30 % ------ iProver source info
% 3.51/1.30
% 3.51/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.51/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.51/1.30 % git: non_committed_changes: false
% 3.51/1.30
% 3.51/1.30 % ------ Parsing...
% 3.51/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.51/1.30
% 3.51/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.51/1.30
% 3.51/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.51/1.30
% 3.51/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.51/1.30 % ------ Proving...
% 3.51/1.30 % ------ Problem Properties
% 3.51/1.30
% 3.51/1.30 %
% 3.51/1.30 % clauses 32
% 3.51/1.30 % conjectures 3
% 3.51/1.30 % EPR 15
% 3.51/1.30 % Horn 25
% 3.51/1.30 % unary 10
% 3.51/1.30 % binary 15
% 3.51/1.30 % lits 62
% 3.51/1.30 % lits eq 10
% 3.51/1.30 % fd_pure 0
% 3.51/1.30 % fd_pseudo 0
% 3.51/1.30 % fd_cond 2
% 3.51/1.30 % fd_pseudo_cond 4
% 3.51/1.30 % AC symbols 0
% 3.51/1.30
% 3.51/1.30 % ------ Schedule dynamic 5 is on
% 3.51/1.30
% 3.51/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.51/1.30
% 3.51/1.30
% 3.51/1.30 % ------
% 3.51/1.30 % Current options:
% 3.51/1.30 % ------
% 3.51/1.30
% 3.51/1.30
% 3.51/1.30 %
% 3.51/1.30
% 3.51/1.30 % ------ Proving...
% 3.51/1.30 %
% 3.51/1.30
% 3.51/1.30 % SZS status Theorem for theBenchmark.p
% 3.51/1.30
% 3.51/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.51/1.30
% 3.51/1.30
%------------------------------------------------------------------------------