%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM613+1 : 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 4.34s 1.32s
% Output : CNFRefutation 4.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 18 unt; 0 def)
% Number of atoms : 55 ( 33 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 50 ( 24 ~; 20 |; 4 &)
% ( 0 <=>; 2 =>; 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 13 ( 0 sgn 13 !; 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(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(f119,plain,
xk != sbrdtbr0(xP),
inference(flattening,[],[f111]) ).
fof(f150,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| szszuzczcdt0(X0) != szszuzczcdt0(X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f26]) ).
fof(f151,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| szszuzczcdt0(X0) != szszuzczcdt0(X1)
| X0 = X1 ),
inference(flattening,[],[f150]) ).
fof(f362,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| szszuzczcdt0(X0) != szszuzczcdt0(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f151]) ).
fof(f469,plain,
xK = szszuzczcdt0(xk),
inference(cnf_transformation,[],[f80]) ).
fof(f470,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[],[f80]) ).
fof(f523,plain,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cnf_transformation,[],[f109]) ).
fof(f524,plain,
sbrdtbr0(xQ) = szszuzczcdt0(sbrdtbr0(xP)),
inference(cnf_transformation,[],[f109]) ).
fof(f525,plain,
szszuzczcdt0(xk) = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f109]) ).
fof(f526,plain,
xk != sbrdtbr0(xP),
inference(cnf_transformation,[],[f119]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ( szszuzczcdt0(X0) != szszuzczcdt0(X1) ) ),
inference(cnf_transformation,[],[f362]) ).
tcf(c_206,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[],[f470]) ).
tcf(c_207,plain,
szszuzczcdt0(xk) = xK,
inference(cnf_transformation,[],[f469]) ).
tcf(c_260,plain,
szszuzczcdt0(xk) = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f525]) ).
tcf(c_261,plain,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f524]) ).
tcf(c_262,plain,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cnf_transformation,[],[f523]) ).
tcf(c_263,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(cnf_transformation,[],[f526]) ).
tcf(c_476,plain,
sbrdtbr0(xQ) = xK,
inference(light_normalisation,[status(thm)],[c_260,c_207]) ).
tcf(c_484,plain,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(light_normalisation,[status(thm)],[c_261,c_476]) ).
tcf(c_761,plain,
! [X0: $i] :
( ( X0 = xk )
| ~ aElementOf0(xk,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ( szszuzczcdt0(X0) != xK ) ),
inference(superposition,[status(thm)],[c_207,c_99]) ).
tcf(c_1538,plain,
! [X0: $i] :
( ( X0 = xk )
| ( szszuzczcdt0(X0) != xK )
| ~ aElementOf0(X0,szNzAzT0) ),
inference(global_subsumption_just,[status(thm)],[c_761,c_206,c_761]) ).
tcf(c_1539,plain,
! [X0: $i] :
( ( X0 = xk )
| ~ aElementOf0(X0,szNzAzT0)
| ( szszuzczcdt0(X0) != xK ) ),
inference(renaming,[status(thm)],[c_1538]) ).
tcf(c_1548,plain,
( ( sbrdtbr0(xP) = xk )
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
inference(superposition,[status(thm)],[c_484,c_1539]) ).
tcf(c_1549,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1548,c_263,c_262]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM613+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n017.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 04:50:30 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 4.34/1.32 % SZS status Started for theBenchmark.p
% 4.34/1.32 % SZS status Theorem for theBenchmark.p
% 4.34/1.32
% 4.34/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.34/1.32
% 4.34/1.32 % ------ iProver source info
% 4.34/1.32
% 4.34/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 4.34/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.34/1.32 % git: non_committed_changes: false
% 4.34/1.32
% 4.34/1.32 % ------ Parsing...
% 4.34/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.34/1.32 % ------ Proving...
% 4.34/1.32 % ------ Problem Properties
% 4.34/1.32
% 4.34/1.32 %
% 4.34/1.32 % clauses 215
% 4.34/1.32 % conjectures 1
% 4.34/1.32 % EPR 56
% 4.34/1.32 % Horn 176
% 4.34/1.32 % unary 52
% 4.34/1.32 % binary 35
% 4.34/1.32 % lits 686
% 4.34/1.32 % lits eq 106
% 4.34/1.32 % fd_pure 0
% 4.34/1.32 % fd_pseudo 0
% 4.34/1.32 % fd_cond 10
% 4.34/1.32 % fd_pseudo_cond 25
% 4.34/1.32 % AC symbols 0
% 4.34/1.32
% 4.34/1.32 % ------ Input Options Time Limit: Unbounded
% 4.34/1.32
% 4.34/1.32
% 4.34/1.32 % ------
% 4.34/1.32 % Current options:
% 4.34/1.32 % ------
% 4.34/1.32
% 4.34/1.32
% 4.34/1.32 %
% 4.34/1.32
% 4.34/1.32 % ------ Proving...
% 4.34/1.32 %
% 4.34/1.32
% 4.34/1.32 % ------ Proving...
% 4.34/1.32 %
% 4.34/1.32
% 4.34/1.32 % SZS status Theorem for theBenchmark.p
% 4.34/1.32
% 4.34/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.34/1.32
% 4.34/1.32
%------------------------------------------------------------------------------