%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM610+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 : 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:26:13 PM UTC 2026
% Result : Theorem 0.44s 1.09s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 53 ( 5 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 53 ( 22 ~; 12 |; 14 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 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 : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 18 ( 0 sgn 13 !; 5 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
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(f107,axiom,
( aSubsetOf0(xP,xQ)
& ! [X0] :
( aElementOf0(X0,xP)
=> aElementOf0(X0,xQ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5195) ).
fof(f108,conjecture,
( aSubsetOf0(xP,xO)
| ! [X0] :
( aElementOf0(X0,xP)
=> aElementOf0(X0,xO) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f109,negated_conjecture,
~ ( aSubsetOf0(xP,xO)
| ! [X0] :
( aElementOf0(X0,xP)
=> aElementOf0(X0,xO) ) ),
inference(negated_conjecture,[status(cth)],[f108]) ).
fof(f129,plain,
( ~ ( xQ = slcrc0
| ~ ? [X1] : aElementOf0(X1,xQ) )
& ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xO) ) ),
inference(rectify,[],[f100]) ).
fof(f261,plain,
( slcrc0 != xQ
& ? [X1] : aElementOf0(X1,xQ)
& ! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xO) ) ),
inference(ennf_transformation,[],[f129]) ).
fof(f262,plain,
( slcrc0 != xQ
& ? [X1] : aElementOf0(X1,xQ)
& ! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xO) ) ),
inference(flattening,[],[f261]) ).
fof(f267,plain,
( aSubsetOf0(xP,xQ)
& ! [X0] :
( ~ aElementOf0(X0,xP)
| aElementOf0(X0,xQ) ) ),
inference(ennf_transformation,[],[f107]) ).
fof(f268,plain,
( ~ aSubsetOf0(xP,xO)
& ? [X0] :
( aElementOf0(X0,xP)
& ~ aElementOf0(X0,xO) ) ),
inference(ennf_transformation,[],[f109]) ).
fof(f449,plain,
( slcrc0 != xQ
& aElementOf0(sK71,xQ)
& ! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xO) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK71]),skolemize(X1,sK71)],[f262]) ).
fof(f453,plain,
( ~ aSubsetOf0(xP,xO)
& aElementOf0(sK73,xP)
& ~ aElementOf0(sK73,xO) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK73]),skolemize(X0,sK73)],[f268]) ).
fof(f853,plain,
! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xO) ),
inference(cnf_transformation,[],[f449]) ).
fof(f875,plain,
! [X0] :
( ~ aElementOf0(X0,xP)
| aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f267]) ).
fof(f877,plain,
aElementOf0(sK73,xP),
inference(cnf_transformation,[],[f453]) ).
fof(f878,plain,
~ aElementOf0(sK73,xO),
inference(cnf_transformation,[],[f453]) ).
tcf(c_446,plain,
! [X0: $i] :
( aElementOf0(X0,xO)
| ~ aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f853]) ).
tcf(c_469,plain,
! [X0: $i] :
( aElementOf0(X0,xQ)
| ~ aElementOf0(X0,xP) ),
inference(cnf_transformation,[],[f875]) ).
tcf(c_471,negated_conjecture,
~ aElementOf0(sK73,xO),
inference(cnf_transformation,[],[f878]) ).
tcf(c_472,negated_conjecture,
aElementOf0(sK73,xP),
inference(cnf_transformation,[],[f877]) ).
tcf(c_530,plain,
aElementOf0(sK73,xQ),
inference(superposition,[status(thm)],[c_472,c_469]) ).
tcf(c_614,plain,
aElementOf0(sK73,xO),
inference(superposition,[status(thm)],[c_530,c_446]) ).
tcf(c_615,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_471,c_614]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM610+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n011.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 04:54:13 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/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.08/0.42
% 0.08/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.42
% 0.08/0.42 % Detected problem language: tptp
% 0.08/0.43 % Proving...
% 0.44/1.09 % SZS status Started for theBenchmark.p
% 0.44/1.09 % SZS status Theorem for theBenchmark.p
% 0.44/1.09
% 0.44/1.09 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.44/1.09
% 0.44/1.09 % ------ iProver source info
% 0.44/1.09
% 0.44/1.09 % git: date: 2026-07-19 20:42:38 +0200
% 0.44/1.09 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.44/1.09 % git: non_committed_changes: false
% 0.44/1.09
% 0.44/1.09 % ------ Parsing...
% 0.44/1.09 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.44/1.09 % ------ Proving...
% 0.44/1.09 % ------ Problem Properties
% 0.44/1.09
% 0.44/1.09 %
% 0.44/1.09 % clauses 425
% 0.44/1.09 % conjectures 3
% 0.44/1.09 % EPR 87
% 0.44/1.09 % Horn 340
% 0.44/1.09 % unary 62
% 0.44/1.09 % binary 126
% 0.44/1.09 % lits 1314
% 0.44/1.09 % lits eq 171
% 0.44/1.09 % fd_pure 0
% 0.44/1.09 % fd_pseudo 0
% 0.44/1.09 % fd_cond 11
% 0.44/1.09 % fd_pseudo_cond 47
% 0.44/1.09 % AC symbols 0
% 0.44/1.09
% 0.44/1.09 % ------ Input Options Time Limit: Unbounded
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 % ------
% 0.44/1.09 % Current options:
% 0.44/1.09 % ------
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 %
% 0.44/1.09
% 0.44/1.09 % ------ Proving...
% 0.44/1.09 %
% 0.44/1.09
% 0.44/1.09 % SZS status Theorem for theBenchmark.p
% 0.44/1.09
% 0.44/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.09
% 0.44/1.09
%------------------------------------------------------------------------------