%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM423+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 : n018.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:12 PM UTC 2026
% Result : Theorem 1.06s 1.36s
% Output : CNFRefutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 14 unt; 2 def)
% Number of atoms : 64 ( 26 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 48 ( 21 ~; 15 |; 10 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 12 !; 2 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntZero) ).
fof(f10,axiom,
! [X0] :
( aInteger0(X0)
=> ( sz00 = sdtpldt0(smndt0(X0),X0)
& sdtpldt0(X0,smndt0(X0)) = sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddNeg) ).
fof(f15,axiom,
! [X0] :
( aInteger0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sdtasdt0(X0,sz00) = sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulZero) ).
fof(f20,axiom,
( xq != sz00
& aInteger0(xq)
& aInteger0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__671) ).
fof(f21,conjecture,
( sdteqdtlpzmzozddtrp0(xa,xa,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
| ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xa))
& aInteger0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f22,negated_conjecture,
~ ( sdteqdtlpzmzozddtrp0(xa,xa,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
| ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xa))
& aInteger0(X0) ) ),
inference(negated_conjecture,[status(cth)],[f21]) ).
fof(f34,plain,
! [X0] :
( ~ aInteger0(X0)
| ( sz00 = sdtpldt0(smndt0(X0),X0)
& sdtpldt0(X0,smndt0(X0)) = sz00 ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f42,plain,
! [X0] :
( ~ aInteger0(X0)
| ( sz00 = sdtasdt0(sz00,X0)
& sdtasdt0(X0,sz00) = sz00 ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f49,plain,
( ~ sdteqdtlpzmzozddtrp0(xa,xa,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
& ! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xa))
| ~ aInteger0(X0) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f55,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f65,plain,
! [X0] :
( ~ aInteger0(X0)
| sz00 = sdtpldt0(X0,smndt0(X0)) ),
inference(cnf_transformation,[],[f34]) ).
fof(f73,plain,
! [X0] :
( ~ aInteger0(X0)
| sz00 = sdtasdt0(X0,sz00) ),
inference(cnf_transformation,[],[f42]) ).
fof(f85,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f20]) ).
fof(f86,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f20]) ).
fof(f89,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xa))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_49,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f55]) ).
tcf(c_58,plain,
! [X0: $i] :
( ( sdtpldt0(X0,smndt0(X0)) = sz00 )
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f65]) ).
tcf(c_66,plain,
! [X0: $i] :
( ( sdtasdt0(X0,sz00) = sz00 )
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_78,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f86]) ).
tcf(c_79,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f85]) ).
tcf(c_81,negated_conjecture,
! [X0: $i] :
( ~ aInteger0(X0)
| ( sdtpldt0(xa,smndt0(xa)) != sdtasdt0(xq,X0) ) ),
inference(cnf_transformation,[],[f89]) ).
tcf(c_797,definition,
iPr_def_10 = smndt0(xa),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_798,definition,
iPr_def_11 = sdtpldt0(xa,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_799,negated_conjecture,
! [X0: $i] :
( ~ aInteger0(X0)
| ( iPr_def_11 != sdtasdt0(xq,X0) ) ),
inference(demodulation,[status(thm)],[c_81,c_797,c_798]) ).
tcf(c_1243,plain,
sdtasdt0(xq,sz00) = sz00,
inference(superposition,[status(thm)],[c_79,c_66]) ).
tcf(c_1386,plain,
( ~ aInteger0(sz00)
| ( sz00 != iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_1243,c_799]) ).
tcf(c_1387,plain,
sz00 != iPr_def_11,
inference(forward_subsumption_resolution,[status(thm)],[c_1386,c_49]) ).
tcf(c_1398,plain,
sdtpldt0(xa,smndt0(xa)) = sz00,
inference(superposition,[status(thm)],[c_78,c_58]) ).
tcf(c_1402,plain,
sz00 = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_1398,c_797,c_798]) ).
tcf(c_1403,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1402,c_1387]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM423+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.41 % Computer : n018.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Thu Sep 24 03:56:18 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.46 Running first-order theorem proving
% 0.15/0.46 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.15/0.48
% 0.15/0.48 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.48
% 0.15/0.48 % Detected problem language: tptp
% 0.15/0.50 % Proving...
% 1.06/1.36 % SZS status Started for theBenchmark.p
% 1.06/1.36 % SZS status Theorem for theBenchmark.p
% 1.06/1.36
% 1.06/1.36 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.06/1.36
% 1.06/1.36 % ------ iProver source info
% 1.06/1.36
% 1.06/1.36 % git: date: 2026-07-19 20:42:38 +0200
% 1.06/1.36 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.06/1.36 % git: non_committed_changes: false
% 1.06/1.36
% 1.06/1.36 % ------ Parsing...
% 1.06/1.36 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.06/1.36
% 1.06/1.36 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 1.06/1.36
% 1.06/1.36 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.06/1.36
% 1.06/1.36 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.06/1.36 % ------ Proving...
% 1.06/1.36 % ------ Problem Properties
% 1.06/1.36
% 1.06/1.36 %
% 1.06/1.36 % clauses 30
% 1.06/1.36 % conjectures 1
% 1.06/1.36 % EPR 5
% 1.06/1.36 % Horn 27
% 1.06/1.36 % unary 7
% 1.06/1.36 % binary 12
% 1.06/1.36 % lits 72
% 1.06/1.36 % lits eq 26
% 1.06/1.36 % fd_pure 0
% 1.06/1.36 % fd_pseudo 0
% 1.06/1.36 % fd_cond 3
% 1.06/1.36 % fd_pseudo_cond 0
% 1.06/1.36 % AC symbols 0
% 1.06/1.36
% 1.06/1.36 % ------ Schedule dynamic 5 is on
% 1.06/1.36
% 1.06/1.36 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.06/1.36
% 1.06/1.36
% 1.06/1.36 % ------
% 1.06/1.36 % Current options:
% 1.06/1.36 % ------
% 1.06/1.36
% 1.06/1.36
% 1.06/1.36 %
% 1.06/1.36
% 1.06/1.36 % ------ Proving...
% 1.06/1.36 %
% 1.06/1.36
% 1.06/1.36 % SZS status Theorem for theBenchmark.p
% 1.06/1.36
% 1.06/1.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.06/1.36
% 1.06/1.36
%------------------------------------------------------------------------------