%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM613+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 : n017.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:14 PM UTC 2026
% Result : Theorem 7.15s 1.80s
% Output : CNFRefutation 7.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 17 unt; 0 def)
% Number of atoms : 66 ( 34 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 61 ( 25 ~; 21 |; 12 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 15 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X0,X1] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X0,szNzAzT0) )
=> ( szszuzczcdt0(X0) = szszuzczcdt0(X1)
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccEquSucc) ).
fof(f80,axiom,
( szszuzczcdt0(xk) = xK
& aElementOf0(xk,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3533) ).
fof(f99,axiom,
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xO) )
& aSet0(xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5078) ).
fof(f109,axiom,
( aElementOf0(sbrdtbr0(xP),szNzAzT0)
& szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ)
& sbrdtbr0(xQ) = szszuzczcdt0(xk) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5255) ).
fof(f110,conjecture,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f111,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(negated_conjecture,[status(cth)],[f110]) ).
fof(f134,plain,
xk != sbrdtbr0(xP),
inference(flattening,[],[f111]) ).
fof(f165,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| szszuzczcdt0(X0) != szszuzczcdt0(X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f26]) ).
fof(f166,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| szszuzczcdt0(X0) != szszuzczcdt0(X1)
| X0 = X1 ),
inference(flattening,[],[f165]) ).
fof(f263,plain,
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xO) )
& aSet0(xQ) ),
inference(ennf_transformation,[],[f99]) ).
fof(f506,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| szszuzczcdt0(X0) != szszuzczcdt0(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f166]) ).
fof(f654,plain,
xK = szszuzczcdt0(xk),
inference(cnf_transformation,[],[f80]) ).
fof(f655,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[],[f80]) ).
fof(f849,plain,
xK = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f263]) ).
fof(f880,plain,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cnf_transformation,[],[f109]) ).
fof(f881,plain,
sbrdtbr0(xQ) = szszuzczcdt0(sbrdtbr0(xP)),
inference(cnf_transformation,[],[f109]) ).
fof(f883,plain,
xk != sbrdtbr0(xP),
inference(cnf_transformation,[],[f134]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ( szszuzczcdt0(X0) != szszuzczcdt0(X1) ) ),
inference(cnf_transformation,[],[f506]) ).
tcf(c_247,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[],[f655]) ).
tcf(c_248,plain,
szszuzczcdt0(xk) = xK,
inference(cnf_transformation,[],[f654]) ).
tcf(c_444,plain,
sbrdtbr0(xQ) = xK,
inference(cnf_transformation,[],[f849]) ).
tcf(c_474,plain,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f881]) ).
tcf(c_475,plain,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cnf_transformation,[],[f880]) ).
tcf(c_476,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(cnf_transformation,[],[f883]) ).
tcf(c_11056,plain,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(light_normalisation,[status(thm)],[c_474,c_444]) ).
tcf(c_11339,plain,
! [X0: $i] :
( ( X0 = xk )
| ~ aElementOf0(xk,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ( szszuzczcdt0(X0) != xK ) ),
inference(superposition,[status(thm)],[c_248,c_99]) ).
tcf(c_12265,plain,
! [X0: $i] :
( ( X0 = xk )
| ( szszuzczcdt0(X0) != xK )
| ~ aElementOf0(X0,szNzAzT0) ),
inference(global_subsumption_just,[status(thm)],[c_11339,c_247,c_11339]) ).
tcf(c_12266,plain,
! [X0: $i] :
( ( X0 = xk )
| ~ aElementOf0(X0,szNzAzT0)
| ( szszuzczcdt0(X0) != xK ) ),
inference(renaming,[status(thm)],[c_12265]) ).
tcf(c_12275,plain,
( ( sbrdtbr0(xP) = xk )
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
inference(superposition,[status(thm)],[c_11056,c_12266]) ).
tcf(c_12276,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_12275,c_476,c_475]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM613+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/0.38 % Computer : n017.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 04:50:16 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.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.10/0.44
% 0.10/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.44
% 0.10/0.44 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 7.15/1.80 % SZS status Started for theBenchmark.p
% 7.15/1.80 % SZS status Theorem for theBenchmark.p
% 7.15/1.80
% 7.15/1.80 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.15/1.80
% 7.15/1.80 % ------ iProver source info
% 7.15/1.80
% 7.15/1.80 % git: date: 2026-07-19 20:42:38 +0200
% 7.15/1.80 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.15/1.80 % git: non_committed_changes: false
% 7.15/1.80
% 7.15/1.80 % ------ Parsing...
% 7.15/1.80 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.15/1.80 % ------ Proving...
% 7.15/1.80 % ------ Problem Properties
% 7.15/1.80
% 7.15/1.80 %
% 7.15/1.80 % clauses 428
% 7.15/1.80 % conjectures 1
% 7.15/1.80 % EPR 86
% 7.15/1.80 % Horn 343
% 7.15/1.80 % unary 64
% 7.15/1.80 % binary 127
% 7.15/1.80 % lits 1318
% 7.15/1.80 % lits eq 174
% 7.15/1.80 % fd_pure 0
% 7.15/1.80 % fd_pseudo 0
% 7.15/1.80 % fd_cond 11
% 7.15/1.80 % fd_pseudo_cond 47
% 7.15/1.80 % AC symbols 0
% 7.15/1.80
% 7.15/1.80 % ------ Input Options Time Limit: Unbounded
% 7.15/1.80
% 7.15/1.80
% 7.15/1.80 % ------
% 7.15/1.80 % Current options:
% 7.15/1.80 % ------
% 7.15/1.80
% 7.15/1.80
% 7.15/1.80 %
% 7.15/1.80
% 7.15/1.80 % ------ Proving...
% 7.15/1.80 %
% 7.15/1.80
% 7.15/1.80 % ------ Proving...
% 7.15/1.80 %
% 7.15/1.80
% 7.15/1.80 % ------ Proving...
% 7.15/1.80 %
% 7.15/1.80
% 7.15/1.80 % SZS status Theorem for theBenchmark.p
% 7.15/1.80
% 7.15/1.80 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.15/1.80
% 7.15/1.80
%------------------------------------------------------------------------------