%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM607+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 : n013.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:26:12 PM UTC 2026
% Result : Theorem 3.24s 1.20s
% Output : CNFRefutation 3.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 7 unt; 0 def)
% Number of atoms : 76 ( 5 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 82 ( 29 ~; 22 |; 22 &)
% ( 0 <=>; 9 =>; 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 : 9 ( 9 usr; 8 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn 17 !; 6 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f98,axiom,
( aSubsetOf0(xO,xS)
& ! [X0] :
( aElementOf0(X0,xO)
=> aElementOf0(X0,xS) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4998) ).
fof(f100,axiom,
( ~ ( xQ = slcrc0
| ~ ? [X0] : aElementOf0(X0,xQ) )
& ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xO) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5093) ).
fof(f102,conjecture,
( aElementOf0(xQ,szDzozmdt0(xc))
| aSubsetOf0(xQ,xS)
| ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xS) )
| aSubsetOf0(xQ,xS)
| ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xS) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f103,negated_conjecture,
~ ( aElementOf0(xQ,szDzozmdt0(xc))
| aSubsetOf0(xQ,xS)
| ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xS) )
| aSubsetOf0(xQ,xS)
| ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xS) ) ),
inference(negated_conjecture,[status(cth)],[f102]) ).
fof(f123,plain,
( ~ ( xQ = slcrc0
| ~ ? [X1] : aElementOf0(X1,xQ) )
& ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xO) ) ),
inference(rectify,[],[f100]) ).
fof(f124,plain,
~ ( aElementOf0(xQ,szDzozmdt0(xc))
| aSubsetOf0(xQ,xS)
| ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
| aSubsetOf0(xQ,xS)
| ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xS) ) ),
inference(rectify,[],[f103]) ).
fof(f252,plain,
( aSubsetOf0(xO,xS)
& ! [X0] :
( ~ aElementOf0(X0,xO)
| aElementOf0(X0,xS) ) ),
inference(ennf_transformation,[],[f98]) ).
fof(f254,plain,
( slcrc0 != xQ
& ? [X1] : aElementOf0(X1,xQ)
& ! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xO) ) ),
inference(ennf_transformation,[],[f123]) ).
fof(f255,plain,
( slcrc0 != xQ
& ? [X1] : aElementOf0(X1,xQ)
& ! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xO) ) ),
inference(flattening,[],[f254]) ).
fof(f257,plain,
( ~ aElementOf0(xQ,szDzozmdt0(xc))
& ~ aSubsetOf0(xQ,xS)
& ? [X1] :
( aElementOf0(X1,xQ)
& ~ aElementOf0(X1,xS) )
& ~ aSubsetOf0(xQ,xS)
& ? [X0] :
( aElementOf0(X0,xQ)
& ~ aElementOf0(X0,xS) ) ),
inference(ennf_transformation,[],[f124]) ).
fof(f438,plain,
( slcrc0 != xQ
& aElementOf0(sK71,xQ)
& ! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xO) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK71]),skolemize(X1,sK71)],[f255]) ).
fof(f439,plain,
( ~ aElementOf0(xQ,szDzozmdt0(xc))
& ~ aSubsetOf0(xQ,xS)
& aElementOf0(sK73,xQ)
& ~ aElementOf0(sK73,xS)
& ~ aSubsetOf0(xQ,xS)
& aElementOf0(sK72,xQ)
& ~ aElementOf0(sK72,xS) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK72,sK73]),skolemize(X0,sK72),skolemize(X1,sK73)],[f257]) ).
fof(f831,plain,
! [X0] :
( ~ aElementOf0(X0,xO)
| aElementOf0(X0,xS) ),
inference(cnf_transformation,[],[f252]) ).
fof(f839,plain,
! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xO) ),
inference(cnf_transformation,[],[f438]) ).
fof(f844,plain,
aElementOf0(sK73,xQ),
inference(cnf_transformation,[],[f439]) ).
fof(f845,plain,
~ aElementOf0(sK73,xS),
inference(cnf_transformation,[],[f439]) ).
tcf(c_439,plain,
! [X0: $i] :
( aElementOf0(X0,xS)
| ~ aElementOf0(X0,xO) ),
inference(cnf_transformation,[],[f831]) ).
tcf(c_446,plain,
! [X0: $i] :
( aElementOf0(X0,xO)
| ~ aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f839]) ).
tcf(c_454,negated_conjecture,
~ aElementOf0(sK73,xS),
inference(cnf_transformation,[],[f845]) ).
tcf(c_455,negated_conjecture,
aElementOf0(sK73,xQ),
inference(cnf_transformation,[],[f844]) ).
tcf(c_529,plain,
aElementOf0(sK73,xO),
inference(superposition,[status(thm)],[c_455,c_446]) ).
tcf(c_704,plain,
aElementOf0(sK73,xS),
inference(superposition,[status(thm)],[c_529,c_439]) ).
tcf(c_705,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_454,c_704]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM607+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.09/0.37 % Computer : n013.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 04:52:36 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 3.24/1.20 % SZS status Started for theBenchmark.p
% 3.24/1.20 % SZS status Theorem for theBenchmark.p
% 3.24/1.20
% 3.24/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.24/1.20
% 3.24/1.20 % ------ iProver source info
% 3.24/1.20
% 3.24/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 3.24/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.24/1.20 % git: non_committed_changes: false
% 3.24/1.20
% 3.24/1.20 % ------ Parsing...
% 3.24/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.24/1.20 % ------ Proving...
% 3.24/1.20 % ------ Problem Properties
% 3.24/1.20
% 3.24/1.20 %
% 3.24/1.20 % clauses 409
% 3.24/1.20 % conjectures 7
% 3.24/1.20 % EPR 78
% 3.24/1.20 % Horn 325
% 3.24/1.20 % unary 54
% 3.24/1.20 % binary 119
% 3.24/1.20 % lits 1288
% 3.24/1.20 % lits eq 167
% 3.24/1.20 % fd_pure 0
% 3.24/1.20 % fd_pseudo 0
% 3.24/1.20 % fd_cond 10
% 3.24/1.20 % fd_pseudo_cond 47
% 3.24/1.20 % AC symbols 0
% 3.24/1.20
% 3.24/1.20 % ------ Input Options Time Limit: Unbounded
% 3.24/1.20
% 3.24/1.20
% 3.24/1.20 % ------
% 3.24/1.20 % Current options:
% 3.24/1.20 % ------
% 3.24/1.20
% 3.24/1.20
% 3.24/1.20 %
% 3.24/1.20
% 3.24/1.20 % ------ Proving...
% 3.24/1.20 %
% 3.24/1.20
% 3.24/1.20 % SZS status Theorem for theBenchmark.p
% 3.24/1.20
% 3.24/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.24/1.20
% 3.24/1.20
%------------------------------------------------------------------------------