%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM477+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 : n013.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:10 PM UTC 2026
% Result : Theorem 0.69s 1.21s
% Output : CNFRefutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 19 unt; 0 def)
% Number of atoms : 121 ( 34 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 135 ( 58 ~; 55 |; 15 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 42 ( 0 sgn 37 !; 5 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sdtasdt0(X0,sz00) = sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulZero) ).
fof(f27,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( X0 != sz00
=> sdtlseqdt0(X1,sdtasdt0(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMonMul2) ).
fof(f30,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( doDivides0(X0,X1)
<=> ? [X2] :
( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiv) ).
fof(f35,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1494) ).
fof(f36,axiom,
( xn != sz00
& doDivides0(xm,xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1494_04) ).
fof(f37,conjecture,
sdtlseqdt0(xm,xn),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f38,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(negated_conjecture,[status(cth)],[f37]) ).
fof(f39,plain,
~ sdtlseqdt0(xm,xn),
inference(flattening,[],[f38]) ).
fof(f41,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sz00 = X0
| sdtlseqdt0(X1,sdtasdt0(X1,X0)) ),
inference(ennf_transformation,[],[f27]) ).
fof(f42,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sz00 = X0
| sdtlseqdt0(X1,sdtasdt0(X1,X0)) ),
inference(flattening,[],[f41]) ).
fof(f51,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( sz00 = sdtasdt0(sz00,X0)
& sdtasdt0(X0,sz00) = sz00 ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f59,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( doDivides0(X0,X1)
<=> ? [X2] :
( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) ) ),
inference(ennf_transformation,[],[f30]) ).
fof(f60,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( doDivides0(X0,X1)
<=> ? [X2] :
( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) ) ),
inference(flattening,[],[f59]) ).
fof(f88,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,[],[f60]) ).
fof(f89,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,[],[f88]) ).
fof(f90,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( ( ~ doDivides0(X0,X1)
| ( sdtasdt0(X0,sK0(X0,X1)) = X1
& aNaturalNumber0(sK0(X0,X1)) ) )
& ( ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
| doDivides0(X0,X1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f89]) ).
fof(f94,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f35]) ).
fof(f95,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f35]) ).
fof(f96,plain,
sz00 != xn,
inference(cnf_transformation,[],[f36]) ).
fof(f97,plain,
doDivides0(xm,xn),
inference(cnf_transformation,[],[f36]) ).
fof(f98,plain,
~ sdtlseqdt0(xm,xn),
inference(cnf_transformation,[],[f39]) ).
fof(f99,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sz00 = X0
| sdtlseqdt0(X1,sdtasdt0(X1,X0)) ),
inference(cnf_transformation,[],[f42]) ).
fof(f110,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| sz00 = sdtasdt0(X0,sz00) ),
inference(cnf_transformation,[],[f51]) ).
fof(f117,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,X1)
| sdtasdt0(X0,sK0(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f90]) ).
fof(f118,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,X1)
| aNaturalNumber0(sK0(X0,X1)) ),
inference(cnf_transformation,[],[f90]) ).
tcf(c_49,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f95]) ).
tcf(c_50,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f94]) ).
tcf(c_51,plain,
doDivides0(xm,xn),
inference(cnf_transformation,[],[f97]) ).
tcf(c_52,plain,
xn != sz00,
inference(cnf_transformation,[],[f96]) ).
tcf(c_53,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(cnf_transformation,[],[f98]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( sdtlseqdt0(X0,sdtasdt0(X0,X1))
| ( X1 = sz00 )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f99]) ).
tcf(c_64,plain,
! [X0: $i] :
( ( sdtasdt0(X0,sz00) = sz00 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f110]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] :
( aNaturalNumber0(sK0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( ( sdtasdt0(X0,sK0(X0,X1)) = X1 )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,X1) ),
inference(cnf_transformation,[],[f117]) ).
tcf(c_2195,plain,
sdtasdt0(xm,sz00) = sz00,
inference(superposition,[status(thm)],[c_49,c_64]) ).
tcf(c_2590,plain,
( ( sdtasdt0(xm,sK0(xm,xn)) = xn )
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm) ),
inference(superposition,[status(thm)],[c_51,c_74]) ).
tcf(c_2598,plain,
sdtasdt0(xm,sK0(xm,xn)) = xn,
inference(forward_subsumption_resolution,[status(thm)],[c_2590,c_50,c_49]) ).
tcf(c_2643,plain,
( sdtlseqdt0(xm,xn)
| ( sK0(xm,xn) = sz00 )
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(sK0(xm,xn)) ),
inference(superposition,[status(thm)],[c_2598,c_54]) ).
tcf(c_2646,plain,
( ( sK0(xm,xn) = sz00 )
| ~ aNaturalNumber0(sK0(xm,xn)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2643,c_53,c_49]) ).
tcf(c_2653,plain,
( ( sK0(xm,xn) = sz00 )
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm)
| ~ doDivides0(xm,xn) ),
inference(superposition,[status(thm)],[c_73,c_2646]) ).
tcf(c_2654,plain,
sK0(xm,xn) = sz00,
inference(forward_subsumption_resolution,[status(thm)],[c_2653,c_50,c_49,c_51]) ).
tcf(c_2655,plain,
sdtasdt0(xm,sz00) = xn,
inference(demodulation,[status(thm)],[c_2598,c_2654]) ).
tcf(c_2656,plain,
xn = sz00,
inference(light_normalisation,[status(thm)],[c_2655,c_2195]) ).
tcf(c_2657,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2656,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM477+1 : 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.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 04:10:21 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 0.69/1.21 % SZS status Started for theBenchmark.p
% 0.69/1.21 % SZS status Theorem for theBenchmark.p
% 0.69/1.21
% 0.69/1.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.69/1.21
% 0.69/1.21 % ------ iProver source info
% 0.69/1.21
% 0.69/1.21 % git: date: 2026-07-19 20:42:38 +0200
% 0.69/1.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.69/1.21 % git: non_committed_changes: false
% 0.69/1.21
% 0.69/1.21 % ------ Parsing...
% 0.69/1.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.69/1.21
% 0.69/1.21 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.69/1.21
% 0.69/1.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.69/1.21
% 0.69/1.21 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.69/1.21 % ------ Proving...
% 0.69/1.21 % ------ Problem Properties
% 0.69/1.21
% 0.69/1.21 %
% 0.69/1.21 % clauses 43
% 0.69/1.21 % conjectures 1
% 0.69/1.21 % EPR 11
% 0.69/1.21 % Horn 34
% 0.69/1.21 % unary 6
% 0.69/1.21 % binary 5
% 0.69/1.21 % lits 164
% 0.69/1.21 % lits eq 38
% 0.69/1.21 % fd_pure 0
% 0.69/1.21 % fd_pseudo 0
% 0.69/1.21 % fd_cond 4
% 0.69/1.21 % fd_pseudo_cond 9
% 0.69/1.21 % AC symbols 0
% 0.69/1.21
% 0.69/1.21 % ------ Schedule dynamic 5 is on
% 0.69/1.21
% 0.69/1.21 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.69/1.21
% 0.69/1.21
% 0.69/1.21 % ------
% 0.69/1.21 % Current options:
% 0.69/1.21 % ------
% 0.69/1.21
% 0.69/1.21
% 0.69/1.21 %
% 0.69/1.21
% 0.69/1.21 % ------ Proving...
% 0.69/1.21 %
% 0.69/1.21
% 0.69/1.21 % SZS status Theorem for theBenchmark.p
% 0.69/1.21
% 0.69/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.69/1.21
% 0.69/1.21
%------------------------------------------------------------------------------