%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM482+1 : 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 : n016.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:25:11 PM UTC 2026
% Result : Theorem 3.78s 1.26s
% Output : CNFRefutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 10 unt; 0 def)
% Number of atoms : 118 ( 19 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 140 ( 60 ~; 53 |; 19 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 42 !; 7 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(f5,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> aNaturalNumber0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(f11,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( X0 = sdtasdt0(sz10,X0)
& sdtasdt0(X0,sz10) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulUnit) ).
fof(f30,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( doDivides0(X0,X1)
<=> ? [X2] :
( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiv) ).
fof(f38,axiom,
aNaturalNumber0(xk),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1716) ).
fof(f41,conjecture,
( isPrime0(xk)
=> ? [X0] :
( isPrime0(X0)
& doDivides0(X0,xk)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f42,negated_conjecture,
~ ( isPrime0(xk)
=> ? [X0] :
( isPrime0(X0)
& doDivides0(X0,xk)
& aNaturalNumber0(X0) ) ),
inference(negated_conjecture,[status(cth)],[f41]) ).
fof(f47,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f48,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(flattening,[],[f47]) ).
fof(f58,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( X0 = sdtasdt0(sz10,X0)
& sdtasdt0(X0,sz10) = X0 ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f91,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( doDivides0(X0,X1)
<=> ? [X2] :
( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) ) ),
inference(ennf_transformation,[],[f30]) ).
fof(f92,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( doDivides0(X0,X1)
<=> ? [X2] :
( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) ) ),
inference(flattening,[],[f91]) ).
fof(f109,plain,
( isPrime0(xk)
& ! [X0] :
( ~ isPrime0(X0)
| ~ doDivides0(X0,xk)
| ~ aNaturalNumber0(X0) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f115,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( ( ~ doDivides0(X0,X1)
| ? [X2] :
( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) )
& ( ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
| doDivides0(X0,X1) ) ) ),
inference(nnf_transformation,[],[f92]) ).
fof(f116,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( ( ~ doDivides0(X0,X1)
| ? [X3] :
( sdtasdt0(X0,X3) = X1
& aNaturalNumber0(X3) ) )
& ( ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
| doDivides0(X0,X1) ) ) ),
inference(rectify,[],[f115]) ).
fof(f117,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( ( ~ doDivides0(X0,X1)
| ( sdtasdt0(X0,sK1(X0,X1)) = X1
& aNaturalNumber0(sK1(X0,X1)) ) )
& ( ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
| doDivides0(X0,X1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1))],[f116]) ).
fof(f127,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f129,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f48]) ).
fof(f137,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| sdtasdt0(X0,sz10) = X0 ),
inference(cnf_transformation,[],[f58]) ).
fof(f174,plain,
! [X2,X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2)
| doDivides0(X0,X1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f190,plain,
aNaturalNumber0(xk),
inference(cnf_transformation,[],[f38]) ).
fof(f196,plain,
isPrime0(xk),
inference(cnf_transformation,[],[f109]) ).
fof(f197,plain,
! [X0] :
( ~ isPrime0(X0)
| ~ doDivides0(X0,xk)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f204,plain,
! [X2,X0] :
( ~ aNaturalNumber0(sdtasdt0(X0,X2))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X2)
| doDivides0(X0,sdtasdt0(X0,X2)) ),
inference(equality_resolution,[],[f174]) ).
tcf(c_50,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f127]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f129]) ).
tcf(c_60,plain,
! [X0: $i] :
( ( sdtasdt0(X0,sz10) = X0 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f137]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] :
( doDivides0(X0,sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f204]) ).
tcf(c_113,plain,
aNaturalNumber0(xk),
inference(cnf_transformation,[],[f190]) ).
tcf(c_119,negated_conjecture,
! [X0: $i] :
( ~ isPrime0(X0)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,xk) ),
inference(cnf_transformation,[],[f197]) ).
tcf(c_120,negated_conjecture,
isPrime0(xk),
inference(cnf_transformation,[],[f196]) ).
tcf(c_168,plain,
! [X0: $i,X1: $i] :
( doDivides0(X0,sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(global_subsumption_just,[status(thm)],[c_95,c_53,c_95]) ).
tcf(c_1530,plain,
! [X0: $i] :
( ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,xk)
| ( X0 != xk ) ),
inference(resolution_lifted,[status(thm)],[c_119,c_120]) ).
tcf(c_1531,plain,
( ~ aNaturalNumber0(xk)
| ~ doDivides0(xk,xk) ),
inference(unflattening,[status(thm)],[c_1530]) ).
tcf(c_4324,plain,
sdtasdt0(xk,sz10) = xk,
inference(superposition,[status(thm)],[c_113,c_60]) ).
tcf(c_4329,plain,
( doDivides0(xk,xk)
| ~ aNaturalNumber0(xk)
| ~ aNaturalNumber0(sz10) ),
inference(superposition,[status(thm)],[c_4324,c_168]) ).
tcf(c_4330,plain,
doDivides0(xk,xk),
inference(forward_subsumption_resolution,[status(thm)],[c_4329,c_113,c_50]) ).
tcf(c_4331,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4330,c_1531,c_113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM482+1 : 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/0.36 % Computer : n016.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 04:17:27 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.39 Running first-order theorem proving
% 0.09/0.39 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.09/0.40
% 0.09/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.40
% 0.09/0.40 % Detected problem language: tptp
% 0.09/0.42 % Proving...
% 3.78/1.26 % SZS status Started for theBenchmark.p
% 3.78/1.26 % SZS status Theorem for theBenchmark.p
% 3.78/1.26
% 3.78/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.78/1.26
% 3.78/1.26 % ------ iProver source info
% 3.78/1.26
% 3.78/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 3.78/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.78/1.26 % git: non_committed_changes: false
% 3.78/1.26
% 3.78/1.26 % ------ Parsing...
% 3.78/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.78/1.26
% 3.78/1.26 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 3.78/1.26
% 3.78/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.78/1.26
% 3.78/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.78/1.26 % ------ Proving...
% 3.78/1.26 % ------ Problem Properties
% 3.78/1.26
% 3.78/1.26 %
% 3.78/1.26 % clauses 66
% 3.78/1.26 % conjectures 2
% 3.78/1.26 % EPR 18
% 3.78/1.26 % Horn 43
% 3.78/1.26 % unary 9
% 3.78/1.26 % binary 7
% 3.78/1.26 % lits 258
% 3.78/1.26 % lits eq 75
% 3.78/1.26 % fd_pure 0
% 3.78/1.26 % fd_pseudo 0
% 3.78/1.26 % fd_cond 15
% 3.78/1.26 % fd_pseudo_cond 10
% 3.78/1.26 % AC symbols 0
% 3.78/1.26
% 3.78/1.26 % ------ Schedule dynamic 5 is on
% 3.78/1.26
% 3.78/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.78/1.26
% 3.78/1.26
% 3.78/1.26 % ------
% 3.78/1.26 % Current options:
% 3.78/1.26 % ------
% 3.78/1.26
% 3.78/1.26
% 3.78/1.26 %
% 3.78/1.26
% 3.78/1.26 % ------ Proving...
% 3.78/1.26 %
% 3.78/1.26
% 3.78/1.26 % SZS status Theorem for theBenchmark.p
% 3.78/1.26
% 3.78/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.78/1.27
% 3.78/1.27
%------------------------------------------------------------------------------