%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM429+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 : n008.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:13 PM UTC 2026
% Result : Theorem 2.29s 1.39s
% Output : CNFRefutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 7 unt; 1 def)
% Number of atoms : 47 ( 16 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 40 ( 12 ~; 5 |; 23 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 6 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 5 !; 6 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f23,axiom,
( sdteqdtlpzmzozddtrp0(xb,xc,xq)
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) )
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__853) ).
fof(f24,conjecture,
? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f25,negated_conjecture,
~ ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
inference(negated_conjecture,[status(cth)],[f24]) ).
fof(f27,plain,
( sdteqdtlpzmzozddtrp0(xb,xc,xq)
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& ? [X1] :
( sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,X1)
& aInteger0(X1) )
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ) ),
inference(rectify,[],[f23]) ).
fof(f57,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f63,plain,
( sdteqdtlpzmzozddtrp0(xb,xc,xq)
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,sK2)
& aInteger0(sK2)
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK1)
& aInteger0(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f27]) ).
fof(f106,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK1),
inference(cnf_transformation,[],[f63]) ).
fof(f107,plain,
aInteger0(sK1),
inference(cnf_transformation,[],[f63]) ).
fof(f108,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_85,plain,
aInteger0(sK1),
inference(cnf_transformation,[],[f107]) ).
tcf(c_86,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK1),
inference(cnf_transformation,[],[f106]) ).
tcf(c_93,negated_conjecture,
! [X0: $i] :
( ~ aInteger0(X0)
| ( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0) ) ),
inference(cnf_transformation,[],[f108]) ).
tcf(c_410,plain,
! [X0: $i] :
( ~ aInteger0(X0)
| ( sdtasdt0(xq,X0) != sdtasdt0(xq,sK1) ) ),
inference(light_normalisation,[status(thm)],[c_93,c_86]) ).
tcf(c_821,definition,
iPr_def_10 = sdtasdt0(xq,sK1),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_822,plain,
! [X0: $i] :
( ~ aInteger0(X0)
| ( sdtasdt0(xq,X0) != iPr_def_10 ) ),
inference(demodulation,[status(thm)],[c_410,c_821]) ).
tcf(c_1378,plain,
~ aInteger0(sK1),
inference(superposition,[status(thm)],[c_821,c_822]) ).
tcf(c_1379,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1378,c_85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM429+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.17/0.43 % Computer : n008.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Thu Sep 24 03:56:54 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.24/0.49 Running first-order theorem proving
% 0.24/0.50 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.24/0.51
% 0.24/0.51 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.51
% 0.24/0.51 % Detected problem language: tptp
% 0.24/0.52 % Proving...
% 2.29/1.39 % SZS status Started for theBenchmark.p
% 2.29/1.39 % SZS status Theorem for theBenchmark.p
% 2.29/1.39
% 2.29/1.39 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.29/1.39
% 2.29/1.39 % ------ iProver source info
% 2.29/1.39
% 2.29/1.39 % git: date: 2026-07-19 20:42:38 +0200
% 2.29/1.39 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.29/1.39 % git: non_committed_changes: false
% 2.29/1.39
% 2.29/1.39 % ------ Parsing...
% 2.29/1.39 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.29/1.39
% 2.29/1.39 % ------ Preprocessing... sup_sim: 3 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.29/1.39
% 2.29/1.39 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.29/1.39
% 2.29/1.39 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.29/1.39 % ------ Proving...
% 2.29/1.39 % ------ Problem Properties
% 2.29/1.39
% 2.29/1.39 %
% 2.29/1.39 % clauses 46
% 2.29/1.39 % conjectures 0
% 2.29/1.39 % EPR 15
% 2.29/1.39 % Horn 40
% 2.29/1.39 % unary 16
% 2.29/1.39 % binary 13
% 2.29/1.39 % lits 110
% 2.29/1.39 % lits eq 30
% 2.29/1.39 % fd_pure 0
% 2.29/1.39 % fd_pseudo 0
% 2.29/1.39 % fd_cond 6
% 2.29/1.39 % fd_pseudo_cond 0
% 2.29/1.39 % AC symbols 0
% 2.29/1.39
% 2.29/1.39 % ------ Schedule dynamic 5 is on
% 2.29/1.39
% 2.29/1.39 % ------ no conjectures: strip conj schedule
% 2.29/1.39
% 2.29/1.39 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.29/1.39
% 2.29/1.39
% 2.29/1.39 % ------
% 2.29/1.39 % Current options:
% 2.29/1.39 % ------
% 2.29/1.39
% 2.29/1.39
% 2.29/1.39 %
% 2.29/1.39
% 2.29/1.39 % ------ Proving...
% 2.29/1.39 %
% 2.29/1.39
% 2.29/1.39 % SZS status Theorem for theBenchmark.p
% 2.29/1.39
% 2.29/1.39 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.29/1.39
% 2.29/1.39
%------------------------------------------------------------------------------