%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM551+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n007.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:25:59 PM UTC 2026
% Result : Theorem 4.05s 1.33s
% Output : CNFRefutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 56 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 54 ( 23 ~; 14 |; 14 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 15 !; 4 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(f62,axiom,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202_02) ).
fof(f65,axiom,
( aElementOf0(xQ,slbdtsldtrb0(xS,xk))
& sbrdtbr0(xQ) = xk
& aSubsetOf0(xQ,xS)
& ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xS) )
& aSet0(xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2270) ).
fof(f67,axiom,
~ ( xQ = slcrc0
| ~ ? [X0] : aElementOf0(X0,xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2313) ).
fof(f68,conjecture,
? [X0] :
( aElementOf0(X0,xQ)
& aElement0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f69,negated_conjecture,
~ ? [X0] :
( aElementOf0(X0,xQ)
& aElement0(X0) ),
inference(negated_conjecture,[status(cth)],[f68]) ).
fof(f78,plain,
( aElementOf0(xQ,slbdtsldtrb0(xS,xk))
& sbrdtbr0(xQ) = xk
& aSubsetOf0(xQ,xS)
& ! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xS) )
& aSet0(xQ) ),
inference(ennf_transformation,[],[f65]) ).
fof(f79,plain,
( slcrc0 != xQ
& ? [X0] : aElementOf0(X0,xQ) ),
inference(ennf_transformation,[],[f67]) ).
fof(f80,plain,
! [X0] :
( ~ aElementOf0(X0,xQ)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f110,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f164,plain,
( slcrc0 != xQ
& aElementOf0(sK8,xQ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X0,sK8)],[f79]) ).
fof(f205,plain,
aSet0(xS),
inference(cnf_transformation,[],[f62]) ).
fof(f237,plain,
! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xS) ),
inference(cnf_transformation,[],[f78]) ).
fof(f243,plain,
aElementOf0(sK8,xQ),
inference(cnf_transformation,[],[f164]) ).
fof(f244,plain,
! [X0] :
( ~ aElementOf0(X0,xQ)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f80]) ).
fof(f283,plain,
! [X0,X1] :
( ~ aSet0(X0)
| ~ aElementOf0(X1,X0)
| aElement0(X1) ),
inference(cnf_transformation,[],[f110]) ).
tcf(c_50,plain,
aSet0(xS),
inference(cnf_transformation,[],[f205]) ).
tcf(c_82,plain,
! [X0: $i] :
( aElementOf0(X0,xS)
| ~ aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f237]) ).
tcf(c_89,plain,
aElementOf0(sK8,xQ),
inference(cnf_transformation,[],[f243]) ).
tcf(c_91,negated_conjecture,
! [X0: $i] :
( ~ aElement0(X0)
| ~ aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f244]) ).
tcf(c_130,plain,
! [X0: $i,X1: $i] :
( aElement0(X0)
| ~ aSet0(X1)
| ~ aElementOf0(X0,X1) ),
inference(cnf_transformation,[],[f283]) ).
tcf(c_10871,plain,
~ aElement0(sK8),
inference(superposition,[status(thm)],[c_89,c_91]) ).
tcf(c_10888,plain,
aElementOf0(sK8,xS),
inference(superposition,[status(thm)],[c_89,c_82]) ).
tcf(c_11027,plain,
( aElement0(sK8)
| ~ aSet0(xS) ),
inference(superposition,[status(thm)],[c_10888,c_130]) ).
tcf(c_11028,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11027,c_10871,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM551+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.39 % Computer : n007.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Thu Sep 24 04:33:08 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.11/0.44
% 0.11/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.44
% 0.11/0.44 % Detected problem language: tptp
% 0.11/0.46 % Proving...
% 4.05/1.33 % SZS status Started for theBenchmark.p
% 4.05/1.33 % SZS status Theorem for theBenchmark.p
% 4.05/1.33
% 4.05/1.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.05/1.33
% 4.05/1.33 % ------ iProver source info
% 4.05/1.33
% 4.05/1.33 % git: date: 2026-07-19 20:42:38 +0200
% 4.05/1.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.05/1.33 % git: non_committed_changes: false
% 4.05/1.33
% 4.05/1.33 % ------ Parsing...
% 4.05/1.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.05/1.33
% 4.05/1.33 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.05/1.33
% 4.05/1.33 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.05/1.33
% 4.05/1.33 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.05/1.33 % ------ Proving...
% 4.05/1.33 % ------ Problem Properties
% 4.05/1.33
% 4.05/1.33 %
% 4.05/1.33 % clauses 134
% 4.05/1.33 % conjectures 1
% 4.05/1.33 % EPR 41
% 4.05/1.33 % Horn 110
% 4.05/1.33 % unary 26
% 4.05/1.33 % binary 25
% 4.05/1.33 % lits 402
% 4.05/1.33 % lits eq 54
% 4.05/1.33 % fd_pure 0
% 4.05/1.33 % fd_pseudo 0
% 4.05/1.33 % fd_cond 4
% 4.05/1.33 % fd_pseudo_cond 14
% 4.05/1.33 % AC symbols 0
% 4.05/1.33
% 4.05/1.33 % ------ Schedule dynamic 5 is on
% 4.05/1.33
% 4.05/1.33 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.05/1.33
% 4.05/1.33
% 4.05/1.33 % ------
% 4.05/1.33 % Current options:
% 4.05/1.33 % ------
% 4.05/1.33
% 4.05/1.33
% 4.05/1.33 %
% 4.05/1.33
% 4.05/1.33 % ------ Proving...
% 4.05/1.33 %
% 4.05/1.33
% 4.05/1.33 % SZS status Theorem for theBenchmark.p
% 4.05/1.33
% 4.05/1.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.05/1.33
% 4.05/1.33
%------------------------------------------------------------------------------