%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM568+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 : n012.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:03 PM UTC 2026
% Result : Theorem 3.11s 0.98s
% Output : CNFRefutation 3.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 52 ( 26 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 47 ( 19 ~; 21 |; 6 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn 11 !; 5 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f27,axiom,
! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( ? [X1] :
( X0 = szszuzczcdt0(X1)
& aElementOf0(X1,szNzAzT0) )
| X0 = sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNatExtra) ).
fof(f74,axiom,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3418) ).
fof(f79,axiom,
xK != sz00,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3520) ).
fof(f80,conjecture,
? [X0] :
( szszuzczcdt0(X0) = xK
& aElementOf0(X0,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f81,negated_conjecture,
~ ? [X0] :
( szszuzczcdt0(X0) = xK
& aElementOf0(X0,szNzAzT0) ),
inference(negated_conjecture,[status(cth)],[f80]) ).
fof(f99,plain,
! [X0] :
( szszuzczcdt0(X0) != xK
| ~ aElementOf0(X0,szNzAzT0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f138,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ? [X1] :
( X0 = szszuzczcdt0(X1)
& aElementOf0(X1,szNzAzT0) )
| X0 = sz00 ),
inference(ennf_transformation,[],[f27]) ).
fof(f139,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ? [X1] :
( X0 = szszuzczcdt0(X1)
& aElementOf0(X1,szNzAzT0) )
| X0 = sz00 ),
inference(flattening,[],[f138]) ).
fof(f202,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ( szszuzczcdt0(sK23(X0)) = X0
& aElementOf0(sK23(X0),szNzAzT0) )
| X0 = sz00 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23]),skolemize(X1,sK23(X0))],[f139]) ).
fof(f218,plain,
aElementOf0(xK,szNzAzT0),
inference(cnf_transformation,[],[f74]) ).
fof(f270,plain,
sz00 != xK,
inference(cnf_transformation,[],[f79]) ).
fof(f271,plain,
! [X0] :
( szszuzczcdt0(X0) != xK
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f321,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| szszuzczcdt0(sK23(X0)) = X0
| sz00 = X0 ),
inference(cnf_transformation,[],[f202]) ).
fof(f322,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| aElementOf0(sK23(X0),szNzAzT0)
| sz00 = X0 ),
inference(cnf_transformation,[],[f202]) ).
tcf(c_51,plain,
aElementOf0(xK,szNzAzT0),
inference(cnf_transformation,[],[f218]) ).
tcf(c_103,plain,
xK != sz00,
inference(cnf_transformation,[],[f270]) ).
tcf(c_104,negated_conjecture,
! [X0: $i] :
( ~ aElementOf0(X0,szNzAzT0)
| ( szszuzczcdt0(X0) != xK ) ),
inference(cnf_transformation,[],[f271]) ).
tcf(c_154,plain,
! [X0: $i] :
( aElementOf0(sK23(X0),szNzAzT0)
| ( X0 = sz00 )
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f322]) ).
tcf(c_155,plain,
! [X0: $i] :
( ( X0 = sz00 )
| ( szszuzczcdt0(sK23(X0)) = X0 )
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f321]) ).
tcf(c_6278,plain,
( aElementOf0(sK23(xK),szNzAzT0)
| ( xK = sz00 )
| ~ aElementOf0(xK,szNzAzT0) ),
inference(instantiation,[status(thm)],[c_154]) ).
tcf(c_6531,plain,
( ( xK = sz00 )
| ( szszuzczcdt0(sK23(xK)) = xK ) ),
inference(superposition,[status(thm)],[c_51,c_155]) ).
tcf(c_6541,plain,
szszuzczcdt0(sK23(xK)) = xK,
inference(forward_subsumption_resolution,[status(thm)],[c_6531,c_103]) ).
tcf(c_6651,plain,
~ aElementOf0(sK23(xK),szNzAzT0),
inference(superposition,[status(thm)],[c_6541,c_104]) ).
tcf(c_6654,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_6651,c_6278,c_103,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM568+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Thu Sep 24 04:40:21 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.31 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.32 Running first-order theorem proving
% 0.04/0.32 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.07/0.33
% 0.07/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.33
% 0.07/0.33 % Detected problem language: tptp
% 0.07/0.34 % Proving...
% 3.11/0.98 % SZS status Started for theBenchmark.p
% 3.11/0.98 % SZS status Theorem for theBenchmark.p
% 3.11/0.98
% 3.11/0.98 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.11/0.98
% 3.11/0.98 % ------ iProver source info
% 3.11/0.98
% 3.11/0.98 % git: date: 2026-07-19 20:42:38 +0200
% 3.11/0.98 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.11/0.98 % git: non_committed_changes: false
% 3.11/0.98
% 3.11/0.98 % ------ Parsing...
% 3.11/0.98 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.11/0.98
% 3.11/0.98 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e %
% 3.11/0.98
% 3.11/0.98 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.11/0.98
% 3.11/0.98 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.11/0.98 % ------ Proving...
% 3.11/0.98 % ------ Problem Properties
% 3.11/0.98
% 3.11/0.98 %
% 3.11/0.98 % clauses 105
% 3.11/0.98 % conjectures 1
% 3.11/0.98 % EPR 26
% 3.11/0.98 % Horn 87
% 3.11/0.98 % unary 20
% 3.11/0.98 % binary 22
% 3.11/0.98 % lits 325
% 3.11/0.98 % lits eq 46
% 3.11/0.98 % fd_pure 0
% 3.11/0.98 % fd_pseudo 0
% 3.11/0.98 % fd_cond 5
% 3.11/0.98 % fd_pseudo_cond 13
% 3.11/0.98 % AC symbols 0
% 3.11/0.98
% 3.11/0.98 % ------ Schedule dynamic 5 is on
% 3.11/0.98
% 3.11/0.98 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.11/0.98
% 3.11/0.98
% 3.11/0.98 % ------
% 3.11/0.98 % Current options:
% 3.11/0.98 % ------
% 3.11/0.98
% 3.11/0.98
% 3.11/0.98 %
% 3.11/0.98
% 3.11/0.98 % ------ Proving...
% 3.11/0.98 %
% 3.11/0.98
% 3.11/0.98 % SZS status Theorem for theBenchmark.p
% 3.11/0.98
% 3.11/0.98 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.11/0.98
% 3.11/0.98
%------------------------------------------------------------------------------