%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM427+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 : n020.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 1.05s 1.36s
% Output : CNFRefutation 1.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 10 unt; 2 def)
% Number of atoms : 49 ( 13 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 37 ( 18 ~; 13 |; 5 &)
% ( 0 <=>; 1 =>; 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 9 !; 2 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( aInteger0(X0)
=> aInteger0(smndt0(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntNeg) ).
fof(f23,axiom,
( sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__747) ).
fof(f24,axiom,
sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__767) ).
fof(f25,conjecture,
( sdteqdtlpzmzozddtrp0(xb,xa,xq)
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
| ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xa))
& aInteger0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f26,negated_conjecture,
~ ( sdteqdtlpzmzozddtrp0(xb,xa,xq)
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
| ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xa))
& aInteger0(X0) ) ),
inference(negated_conjecture,[status(cth)],[f25]) ).
fof(f28,plain,
! [X0] :
( ~ aInteger0(X0)
| aInteger0(smndt0(X0)) ),
inference(ennf_transformation,[],[f4]) ).
fof(f55,plain,
( ~ sdteqdtlpzmzozddtrp0(xb,xa,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
& ! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xa))
| ~ aInteger0(X0) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f64,plain,
! [X0] :
( ~ aInteger0(X0)
| aInteger0(smndt0(X0)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f101,plain,
aInteger0(xn),
inference(cnf_transformation,[],[f23]) ).
fof(f102,plain,
sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
inference(cnf_transformation,[],[f24]) ).
fof(f105,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xa))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f55]) ).
tcf(c_51,plain,
! [X0: $i] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f64]) ).
tcf(c_87,plain,
aInteger0(xn),
inference(cnf_transformation,[],[f101]) ).
tcf(c_89,plain,
sdtpldt0(xb,smndt0(xa)) = sdtasdt0(xq,smndt0(xn)),
inference(cnf_transformation,[],[f102]) ).
tcf(c_90,negated_conjecture,
! [X0: $i] :
( ~ aInteger0(X0)
| ( sdtpldt0(xb,smndt0(xa)) != sdtasdt0(xq,X0) ) ),
inference(cnf_transformation,[],[f105]) ).
tcf(c_398,plain,
! [X0: $i] :
( ~ aInteger0(X0)
| ( sdtasdt0(xq,smndt0(xn)) != sdtasdt0(xq,X0) ) ),
inference(light_normalisation,[status(thm)],[c_90,c_89]) ).
tcf(c_806,definition,
iPr_def_10 = smndt0(xn),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_807,definition,
iPr_def_11 = sdtasdt0(xq,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_812,plain,
! [X0: $i] :
( ~ aInteger0(X0)
| ( iPr_def_11 != sdtasdt0(xq,X0) ) ),
inference(demodulation,[status(thm)],[c_398,c_806,c_807]) ).
tcf(c_1303,plain,
( aInteger0(iPr_def_10)
| ~ aInteger0(xn) ),
inference(superposition,[status(thm)],[c_806,c_51]) ).
tcf(c_1306,plain,
aInteger0(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_1303,c_87]) ).
tcf(c_1310,plain,
~ aInteger0(iPr_def_10),
inference(superposition,[status(thm)],[c_807,c_812]) ).
tcf(c_1311,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1310,c_1306]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM427+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.18/0.42 % Computer : n020.cluster.edu
% 0.18/0.42 % Model : x86_64 x86_64
% 0.18/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.42 % Memory : 8046.5625MB
% 0.18/0.42 % OS : Linux 6.8.0-71-generic
% 0.18/0.42 % CPULimit : 300
% 0.18/0.42 % WCLimit : 300
% 0.18/0.42 % DateTime : Thu Sep 24 03:56:19 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.48 Running first-order theorem proving
% 0.18/0.48 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.18/0.49
% 0.18/0.49 % ======== iProver multi-core TPTP/SMT =========
% 0.18/0.50
% 0.18/0.50 % Detected problem language: tptp
% 0.25/0.51 % Proving...
% 1.05/1.36 % SZS status Started for theBenchmark.p
% 1.05/1.36 % SZS status Theorem for theBenchmark.p
% 1.05/1.36
% 1.05/1.36 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.05/1.36
% 1.05/1.36 % ------ iProver source info
% 1.05/1.36
% 1.05/1.36 % git: date: 2026-07-19 20:42:38 +0200
% 1.05/1.36 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.05/1.36 % git: non_committed_changes: false
% 1.05/1.36
% 1.05/1.36 % ------ Parsing...
% 1.05/1.36 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.05/1.36
% 1.05/1.36 % ------ Preprocessing... sup_sim: 4 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e %
% 1.05/1.36
% 1.05/1.36 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.05/1.36
% 1.05/1.36 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.05/1.36 % ------ Proving...
% 1.05/1.36 % ------ Problem Properties
% 1.05/1.36
% 1.05/1.36 %
% 1.05/1.36 % clauses 48
% 1.05/1.36 % conjectures 1
% 1.05/1.36 % EPR 14
% 1.05/1.36 % Horn 45
% 1.05/1.36 % unary 19
% 1.05/1.36 % binary 15
% 1.05/1.36 % lits 99
% 1.05/1.36 % lits eq 35
% 1.05/1.36 % fd_pure 0
% 1.05/1.36 % fd_pseudo 0
% 1.05/1.36 % fd_cond 3
% 1.05/1.36 % fd_pseudo_cond 0
% 1.05/1.36 % AC symbols 0
% 1.05/1.36
% 1.05/1.36 % ------ Schedule dynamic 5 is on
% 1.05/1.36
% 1.05/1.36 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.05/1.36
% 1.05/1.36
% 1.05/1.36 % ------
% 1.05/1.36 % Current options:
% 1.05/1.36 % ------
% 1.05/1.36
% 1.05/1.36
% 1.05/1.36 %
% 1.05/1.36
% 1.05/1.36 % ------ Proving...
% 1.05/1.36 %
% 1.05/1.36
% 1.05/1.36 % SZS status Theorem for theBenchmark.p
% 1.05/1.36
% 1.05/1.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.05/1.36
% 1.05/1.36
%------------------------------------------------------------------------------