%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU121+1 : 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 : n006.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 1.85s 6.28s
% Output : CNFRefutation 1.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 31 ( 11 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 73 ( 28 ~; 26 |; 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 : 3 ( 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(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f8,conjecture,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f16,plain,
? [X0,X1,X2] :
( subset(X1,X2)
& subset(X0,X1)
& ~ subset(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f17,plain,
? [X0,X1,X2] :
( subset(X1,X2)
& subset(X0,X1)
& ~ subset(X0,X2) ),
inference(flattening,[],[f16]) ).
fof(f21,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,[],[f15]) ).
fof(f22,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,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK0(X0,X1),X0)
& ~ in(sK0(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f22]) ).
fof(f26,plain,
( subset(sK4,sK5)
& subset(sK3,sK4)
& ~ subset(sK3,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5)],[f17]) ).
fof(f28,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f29,plain,
! [X0,X1] :
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f30,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f35,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f26]) ).
fof(f36,plain,
subset(sK3,sK4),
inference(cnf_transformation,[],[f26]) ).
fof(f37,plain,
~ subset(sK3,sK5),
inference(cnf_transformation,[],[f26]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ subset(X1,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_57,negated_conjecture,
~ subset(sK3,sK5),
inference(cnf_transformation,[],[f37]) ).
tcf(c_58,negated_conjecture,
subset(sK3,sK4),
inference(cnf_transformation,[],[f36]) ).
tcf(c_59,negated_conjecture,
subset(sK4,sK5),
inference(cnf_transformation,[],[f35]) ).
tcf(c_237,negated_conjecture,
subset(sK4,sK5),
inference(demodulation,[status(thm)],[c_59]) ).
tcf(c_238,negated_conjecture,
subset(sK3,sK4),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_239,negated_conjecture,
~ subset(sK3,sK5),
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_448,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(X0,X2)
| in(sK0(X0,X2),X1)
| ~ subset(X0,X1) ),
inference(superposition,[status(thm)],[c_51,c_52]) ).
tcf(c_458,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( subset(X0,X3)
| in(sK0(X0,X3),X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(superposition,[status(thm)],[c_448,c_52]) ).
tcf(c_546,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK0(X0,X1),sK5)
| ~ subset(X0,sK4) ),
inference(superposition,[status(thm)],[c_237,c_458]) ).
tcf(c_607,plain,
! [X0: $i] :
( subset(X0,sK5)
| ~ subset(X0,sK4) ),
inference(superposition,[status(thm)],[c_546,c_50]) ).
tcf(c_631,plain,
subset(sK3,sK5),
inference(superposition,[status(thm)],[c_238,c_607]) ).
tcf(c_633,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_631,c_239]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU121+1 : 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/5.38 % Computer : n006.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Thu Sep 24 12:48:05 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.44 % Proving...
% 1.85/6.28 % SZS status Started for theBenchmark.p
% 1.85/6.28 % SZS status Theorem for theBenchmark.p
% 1.85/6.28
% 1.85/6.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.85/6.28
% 1.85/6.28 % ------ iProver source info
% 1.85/6.28
% 1.85/6.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.85/6.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.85/6.28 % git: non_committed_changes: false
% 1.85/6.28
% 1.85/6.28 % ------ Parsing...
% 1.85/6.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.85/6.28
% 1.85/6.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.85/6.28
% 1.85/6.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.85/6.28
% 1.85/6.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.85/6.28 % ------ Proving...
% 1.85/6.28 % ------ Problem Properties
% 1.85/6.28
% 1.85/6.28 %
% 1.85/6.28 % clauses 14
% 1.85/6.28 % conjectures 3
% 1.85/6.28 % EPR 12
% 1.85/6.28 % Horn 13
% 1.85/6.28 % unary 7
% 1.85/6.28 % binary 5
% 1.85/6.28 % lits 23
% 1.85/6.28 % lits eq 2
% 1.85/6.28 % fd_pure 0
% 1.85/6.28 % fd_pseudo 0
% 1.85/6.28 % fd_cond 1
% 1.85/6.28 % fd_pseudo_cond 1
% 1.85/6.28 % AC symbols 0
% 1.85/6.28
% 1.85/6.28 % ------ Schedule dynamic 5 is on
% 1.85/6.28
% 1.85/6.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.85/6.28
% 1.85/6.28
% 1.85/6.28 % ------
% 1.85/6.28 % Current options:
% 1.85/6.28 % ------
% 1.85/6.28
% 1.85/6.28
% 1.85/6.28 %
% 1.85/6.28
% 1.85/6.28 % ------ Proving...
% 1.85/6.28 %
% 1.85/6.28
% 1.85/6.28 % SZS status Theorem for theBenchmark.p
% 1.85/6.28
% 1.85/6.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.85/6.28
% 1.85/6.28
%------------------------------------------------------------------------------