%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM594+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n015.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:09 PM UTC 2026
% Result : Theorem 4.41s 6.31s
% Output : CNFRefutation 4.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 65 ( 23 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 71 ( 26 ~; 17 |; 25 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 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 : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 12 !; 5 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f92,axiom,
( ! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ! [X1] :
( ( ( aElementOf0(X1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),xk))
| ( sbrdtbr0(X1) = xk
& ( aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X0)))
| ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X0))) ) ) ) )
& aSet0(X1) )
=> sdtlpdtrp0(xd,X0) = sdtlpdtrp0(sdtlpdtrp0(xC,X0),X1) ) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4730) ).
fof(f94,axiom,
( aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd)))
& ? [X0] :
( sdtlpdtrp0(xd,X0) = xx
& aElementOf0(X0,szDzozmdt0(xd)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4781) ).
fof(f95,conjecture,
? [X0] :
( sdtlpdtrp0(xd,X0) = xx
& aElementOf0(X0,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f96,negated_conjecture,
~ ? [X0] :
( sdtlpdtrp0(xd,X0) = xx
& aElementOf0(X0,szNzAzT0) ),
inference(negated_conjecture,[status(cth)],[f95]) ).
fof(f236,plain,
( ! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ! [X1] :
( ( ~ aElementOf0(X1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),xk))
& ( sbrdtbr0(X1) != xk
| ( ~ aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& ? [X2] :
( aElementOf0(X2,X1)
& ~ aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X0))) ) ) ) )
| ~ aSet0(X1)
| sdtlpdtrp0(xd,X0) = sdtlpdtrp0(sdtlpdtrp0(xC,X0),X1) ) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
inference(ennf_transformation,[],[f92]) ).
fof(f237,plain,
( ! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ! [X1] :
( ( ~ aElementOf0(X1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),xk))
& ( sbrdtbr0(X1) != xk
| ( ~ aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& ? [X2] :
( aElementOf0(X2,X1)
& ~ aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X0))) ) ) ) )
| ~ aSet0(X1)
| sdtlpdtrp0(xd,X0) = sdtlpdtrp0(sdtlpdtrp0(xC,X0),X1) ) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
inference(flattening,[],[f236]) ).
fof(f238,plain,
! [X0] :
( sdtlpdtrp0(xd,X0) != xx
| ~ aElementOf0(X0,szNzAzT0) ),
inference(ennf_transformation,[],[f96]) ).
fof(f407,plain,
( ! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ! [X1] :
( ( ~ aElementOf0(X1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),xk))
& ( sbrdtbr0(X1) != xk
| ( ~ aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& aElementOf0(sK67(X0,X1),X1)
& ~ aElementOf0(sK67(X0,X1),sdtlpdtrp0(xN,szszuzczcdt0(X0))) ) ) )
| ~ aSet0(X1)
| sdtlpdtrp0(xd,X0) = sdtlpdtrp0(sdtlpdtrp0(xC,X0),X1) ) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK67]),skolemize(X2,sK67(X0,X1))],[f237]) ).
fof(f411,plain,
( aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd)))
& xx = sdtlpdtrp0(xd,sK69)
& aElementOf0(sK69,szDzozmdt0(xd)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK69]),skolemize(X0,sK69)],[f94]) ).
fof(f770,plain,
szNzAzT0 = szDzozmdt0(xd),
inference(cnf_transformation,[],[f407]) ).
fof(f777,plain,
xx = sdtlpdtrp0(xd,sK69),
inference(cnf_transformation,[],[f411]) ).
fof(f778,plain,
aElementOf0(sK69,szDzozmdt0(xd)),
inference(cnf_transformation,[],[f411]) ).
fof(f779,plain,
! [X0] :
( sdtlpdtrp0(xd,X0) != xx
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f238]) ).
tcf(c_404,plain,
szDzozmdt0(xd) = szNzAzT0,
inference(cnf_transformation,[],[f770]) ).
tcf(c_413,plain,
aElementOf0(sK69,szDzozmdt0(xd)),
inference(cnf_transformation,[],[f778]) ).
tcf(c_414,plain,
sdtlpdtrp0(xd,sK69) = xx,
inference(cnf_transformation,[],[f777]) ).
tcf(c_416,negated_conjecture,
! [X0: $i] :
( ~ aElementOf0(X0,szNzAzT0)
| ( sdtlpdtrp0(xd,X0) != xx ) ),
inference(cnf_transformation,[],[f779]) ).
tcf(c_464,plain,
~ aElementOf0(sK69,szNzAzT0),
inference(superposition,[status(thm)],[c_414,c_416]) ).
tcf(c_530,plain,
aElementOf0(sK69,szNzAzT0),
inference(superposition,[status(thm)],[c_404,c_413]) ).
tcf(c_531,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_530,c_464]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM594+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.38 % Computer : n015.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.39 % CPULimit : 300
% 0.10/5.39 % WCLimit : 300
% 0.10/5.39 % DateTime : Thu Sep 24 04:52:03 UTC 2026
% 0.10/5.39 % CPUTime :
% 0.10/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.44
% 0.15/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44
% 0.15/5.44 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 4.41/6.31 % SZS status Started for theBenchmark.p
% 4.41/6.31 % SZS status Theorem for theBenchmark.p
% 4.41/6.31
% 4.41/6.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.41/6.31
% 4.41/6.31 % ------ iProver source info
% 4.41/6.31
% 4.41/6.31 % git: date: 2026-07-19 20:42:38 +0200
% 4.41/6.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.41/6.31 % git: non_committed_changes: false
% 4.41/6.31
% 4.41/6.31 % ------ Parsing...
% 4.41/6.31 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.41/6.31 % ------ Proving...
% 4.41/6.31 % ------ Problem Properties
% 4.41/6.31
% 4.41/6.31 %
% 4.41/6.31 % clauses 368
% 4.41/6.31 % conjectures 1
% 4.41/6.31 % EPR 59
% 4.41/6.31 % Horn 284
% 4.41/6.31 % unary 34
% 4.41/6.31 % binary 100
% 4.41/6.31 % lits 1224
% 4.41/6.31 % lits eq 157
% 4.41/6.31 % fd_pure 0
% 4.41/6.31 % fd_pseudo 0
% 4.41/6.31 % fd_cond 10
% 4.41/6.31 % fd_pseudo_cond 47
% 4.41/6.31 % AC symbols 0
% 4.41/6.31
% 4.41/6.31 % ------ Input Options Time Limit: Unbounded
% 4.41/6.31
% 4.41/6.31
% 4.41/6.31 % ------
% 4.41/6.31 % Current options:
% 4.41/6.31 % ------
% 4.41/6.31
% 4.41/6.31
% 4.41/6.31 %
% 4.41/6.31
% 4.41/6.31 % ------ Proving...
% 4.41/6.31 %
% 4.41/6.31
% 4.41/6.31 % ------ Proving...
% 4.41/6.31 %
% 4.41/6.31
% 4.41/6.31 % SZS status Theorem for theBenchmark.p
% 4.41/6.31
% 4.41/6.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.41/6.31
% 4.41/6.31
%------------------------------------------------------------------------------