%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM623+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 : n002.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:16 PM UTC 2026
% Result : Theorem 4.37s 6.28s
% Output : CNFRefutation 4.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 18 unt; 0 def)
% Number of atoms : 85 ( 15 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 78 ( 32 ~; 28 |; 13 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 22 !; 1 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f35,axiom,
! [X0,X1] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X0,szNzAzT0) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessASymm) ).
fof(f101,axiom,
( aSubsetOf0(xQ,szNzAzT0)
& ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5106) ).
fof(f103,axiom,
( xp = szmzizndt0(xQ)
& ! [X0] :
( aElementOf0(X0,xQ)
=> sdtlseqdt0(xp,X0) )
& aElementOf0(xp,xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5147) ).
fof(f105,axiom,
aElementOf0(xp,xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5173) ).
fof(f114,axiom,
( ? [X0] :
( sdtlpdtrp0(xe,X0) = xx
& aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& aElementOf0(xx,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5365) ).
fof(f116,axiom,
! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xm))
=> sdtlseqdt0(xx,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5401) ).
fof(f119,axiom,
( aElementOf0(xx,xQ)
& aElementOf0(xp,sdtlpdtrp0(xN,xm)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5481) ).
fof(f120,conjecture,
xp = xx,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f121,negated_conjecture,
xp != xx,
inference(negated_conjecture,[status(cth)],[f120]) ).
fof(f144,plain,
xp != xx,
inference(flattening,[],[f121]) ).
fof(f186,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f35]) ).
fof(f187,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f186]) ).
fof(f276,plain,
( aSubsetOf0(xQ,szNzAzT0)
& ! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,szNzAzT0) ) ),
inference(ennf_transformation,[],[f101]) ).
fof(f278,plain,
( xp = szmzizndt0(xQ)
& ! [X0] :
( ~ aElementOf0(X0,xQ)
| sdtlseqdt0(xp,X0) )
& aElementOf0(xp,xQ) ),
inference(ennf_transformation,[],[f103]) ).
fof(f282,plain,
! [X0] :
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xm))
| sdtlseqdt0(xx,X0) ),
inference(ennf_transformation,[],[f116]) ).
fof(f469,plain,
( xx = sdtlpdtrp0(xe,sK73)
& aElementOf0(sK73,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(xx,szNzAzT0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK73]),skolemize(X0,sK73)],[f114]) ).
fof(f531,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f187]) ).
fof(f872,plain,
! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f276]) ).
fof(f879,plain,
! [X0] :
( ~ aElementOf0(X0,xQ)
| sdtlseqdt0(xp,X0) ),
inference(cnf_transformation,[],[f278]) ).
fof(f888,plain,
aElementOf0(xp,xQ),
inference(cnf_transformation,[],[f105]) ).
fof(f909,plain,
aElementOf0(xx,szNzAzT0),
inference(cnf_transformation,[],[f469]) ).
fof(f912,plain,
! [X0] :
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xm))
| sdtlseqdt0(xx,X0) ),
inference(cnf_transformation,[],[f282]) ).
fof(f918,plain,
aElementOf0(xx,xQ),
inference(cnf_transformation,[],[f119]) ).
fof(f919,plain,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(cnf_transformation,[],[f119]) ).
fof(f920,plain,
xp != xx,
inference(cnf_transformation,[],[f144]) ).
tcf(c_109,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1) ),
inference(cnf_transformation,[],[f531]) ).
tcf(c_449,plain,
! [X0: $i] :
( aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f872]) ).
tcf(c_457,plain,
! [X0: $i] :
( sdtlseqdt0(xp,X0)
| ~ aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f879]) ).
tcf(c_466,plain,
aElementOf0(xp,xQ),
inference(cnf_transformation,[],[f888]) ).
tcf(c_485,plain,
aElementOf0(xx,szNzAzT0),
inference(cnf_transformation,[],[f909]) ).
tcf(c_490,plain,
! [X0: $i] :
( sdtlseqdt0(xx,X0)
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xm)) ),
inference(cnf_transformation,[],[f912]) ).
tcf(c_496,plain,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(cnf_transformation,[],[f919]) ).
tcf(c_497,plain,
aElementOf0(xx,xQ),
inference(cnf_transformation,[],[f918]) ).
tcf(c_498,negated_conjecture,
xp != xx,
inference(cnf_transformation,[],[f920]) ).
tcf(c_549,plain,
sdtlseqdt0(xx,xp),
inference(superposition,[status(thm)],[c_496,c_490]) ).
tcf(c_582,plain,
sdtlseqdt0(xp,xx),
inference(superposition,[status(thm)],[c_497,c_457]) ).
tcf(c_588,plain,
aElementOf0(xp,szNzAzT0),
inference(superposition,[status(thm)],[c_466,c_449]) ).
tcf(c_762,plain,
( ( xp = xx )
| ~ sdtlseqdt0(xx,xp)
| ~ aElementOf0(xx,szNzAzT0)
| ~ aElementOf0(xp,szNzAzT0) ),
inference(superposition,[status(thm)],[c_582,c_109]) ).
tcf(c_763,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_762,c_588,c_549,c_498,c_485]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM623+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/5.37 % Computer : n002.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Thu Sep 24 05:01:14 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.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.14/5.42
% 0.14/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.42
% 0.14/5.42 % Detected problem language: tptp
% 0.14/5.43 % Proving...
% 4.37/6.28 % SZS status Started for theBenchmark.p
% 4.37/6.28 % SZS status Theorem for theBenchmark.p
% 4.37/6.28
% 4.37/6.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.37/6.28
% 4.37/6.28 % ------ iProver source info
% 4.37/6.28
% 4.37/6.28 % git: date: 2026-07-19 20:42:38 +0200
% 4.37/6.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.37/6.28 % git: non_committed_changes: false
% 4.37/6.28
% 4.37/6.28 % ------ Parsing...
% 4.37/6.28 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.37/6.28 % ------ Proving...
% 4.37/6.28 % ------ Problem Properties
% 4.37/6.28
% 4.37/6.28 %
% 4.37/6.28 % clauses 450
% 4.37/6.28 % conjectures 1
% 4.37/6.28 % EPR 94
% 4.37/6.28 % Horn 365
% 4.37/6.28 % unary 84
% 4.37/6.28 % binary 129
% 4.37/6.28 % lits 1342
% 4.37/6.28 % lits eq 179
% 4.37/6.28 % fd_pure 0
% 4.37/6.28 % fd_pseudo 0
% 4.37/6.28 % fd_cond 11
% 4.37/6.28 % fd_pseudo_cond 47
% 4.37/6.28 % AC symbols 0
% 4.37/6.28
% 4.37/6.28 % ------ Input Options Time Limit: Unbounded
% 4.37/6.28
% 4.37/6.28
% 4.37/6.28 % ------
% 4.37/6.28 % Current options:
% 4.37/6.28 % ------
% 4.37/6.28
% 4.37/6.28
% 4.37/6.28 %
% 4.37/6.28
% 4.37/6.28 % ------ Proving...
% 4.37/6.28 %
% 4.37/6.28
% 4.37/6.28 % ------ Proving...
% 4.37/6.28 %
% 4.37/6.28
% 4.37/6.28 % SZS status Theorem for theBenchmark.p
% 4.37/6.28
% 4.37/6.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.37/6.28
% 4.37/6.28
%------------------------------------------------------------------------------