%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM432+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 : n014.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:24:14 PM UTC 2026
% Result : Theorem 3.12s 1.18s
% Output : CNFRefutation 3.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 12 unt; 2 def)
% Number of atoms : 56 ( 14 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 47 ( 22 ~; 17 |; 7 &)
% ( 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 : 7 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 14 !; 2 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntPlus) ).
fof(f24,axiom,
( sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__876) ).
fof(f25,axiom,
( sdtasdt0(xq,xm) = sdtpldt0(xb,smndt0(xc))
& aInteger0(xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__899) ).
fof(f26,axiom,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__924) ).
fof(f27,conjecture,
( sdteqdtlpzmzozddtrp0(xa,xc,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xc))
& aInteger0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f28,negated_conjecture,
~ ( sdteqdtlpzmzozddtrp0(xa,xc,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xc))
& aInteger0(X0) ) ),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f32,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f33,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(flattening,[],[f32]) ).
fof(f60,plain,
( ~ sdteqdtlpzmzozddtrp0(xa,xc,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
& ! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xc))
| ~ aInteger0(X0) ) ),
inference(ennf_transformation,[],[f28]) ).
fof(f70,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f33]) ).
fof(f112,plain,
aInteger0(xn),
inference(cnf_transformation,[],[f24]) ).
fof(f114,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f25]) ).
fof(f115,plain,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
inference(cnf_transformation,[],[f26]) ).
fof(f118,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xc))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f60]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f70]) ).
tcf(c_93,plain,
aInteger0(xn),
inference(cnf_transformation,[],[f112]) ).
tcf(c_95,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f114]) ).
tcf(c_97,plain,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
inference(cnf_transformation,[],[f115]) ).
tcf(c_98,negated_conjecture,
! [X0: $i] :
( ~ aInteger0(X0)
| ( sdtpldt0(xa,smndt0(xc)) != sdtasdt0(xq,X0) ) ),
inference(cnf_transformation,[],[f118]) ).
tcf(c_886,definition,
iPr_def_10 = smndt0(xc),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_887,definition,
iPr_def_11 = sdtpldt0(xa,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_890,negated_conjecture,
! [X0: $i] :
( ~ aInteger0(X0)
| ( iPr_def_11 != sdtasdt0(xq,X0) ) ),
inference(demodulation,[status(thm)],[c_98]) ).
tcf(c_2196,plain,
sdtasdt0(xq,sdtpldt0(xn,xm)) = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_97,c_886,c_887]) ).
tcf(c_2198,plain,
~ aInteger0(sdtpldt0(xn,xm)),
inference(superposition,[status(thm)],[c_2196,c_890]) ).
tcf(c_2445,plain,
( ~ aInteger0(xm)
| ~ aInteger0(xn) ),
inference(superposition,[status(thm)],[c_52,c_2198]) ).
tcf(c_2446,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2445,c_95,c_93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM432+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.09/0.37 % Computer : n014.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 03:57:03 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 3.12/1.18 % SZS status Started for theBenchmark.p
% 3.12/1.18 % SZS status Theorem for theBenchmark.p
% 3.12/1.18
% 3.12/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.12/1.18
% 3.12/1.18 % ------ iProver source info
% 3.12/1.18
% 3.12/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 3.12/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.12/1.18 % git: non_committed_changes: false
% 3.12/1.18
% 3.12/1.18 % ------ Parsing...
% 3.12/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.12/1.18
% 3.12/1.18 % ------ Preprocessing... sup_sim: 4 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.12/1.18
% 3.12/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.12/1.18
% 3.12/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.12/1.18 % ------ Proving...
% 3.12/1.18 % ------ Problem Properties
% 3.12/1.18
% 3.12/1.18 %
% 3.12/1.18 % clauses 54
% 3.12/1.18 % conjectures 3
% 3.12/1.18 % EPR 19
% 3.12/1.18 % Horn 48
% 3.12/1.18 % unary 24
% 3.12/1.18 % binary 13
% 3.12/1.18 % lits 118
% 3.12/1.18 % lits eq 34
% 3.12/1.18 % fd_pure 0
% 3.12/1.18 % fd_pseudo 0
% 3.12/1.18 % fd_cond 6
% 3.12/1.18 % fd_pseudo_cond 0
% 3.12/1.18 % AC symbols 0
% 3.12/1.18
% 3.12/1.18 % ------ Schedule dynamic 5 is on
% 3.12/1.18
% 3.12/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.12/1.18
% 3.12/1.18
% 3.12/1.18 % ------
% 3.12/1.18 % Current options:
% 3.12/1.18 % ------
% 3.12/1.18
% 3.12/1.18
% 3.12/1.18 %
% 3.12/1.18
% 3.12/1.18 % ------ Proving...
% 3.12/1.18 %
% 3.12/1.18
% 3.12/1.18 % SZS status Theorem for theBenchmark.p
% 3.12/1.18
% 3.12/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.12/1.18
% 3.12/1.18
%------------------------------------------------------------------------------