%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM015-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n015.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:23:14 PM UTC 2026
% Result : Unsatisfiable 1.63s 1.28s
% Output : CNFRefutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 4 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 69 ( 33 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : divides(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divide_self) ).
fof(f2,axiom,
! [X2,X0,X1] :
( divides(X0,X2)
| ~ divides(X1,X2)
| ~ divides(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_divide) ).
fof(f3,axiom,
! [X0] :
( divides(divisor(X0),X0)
| prime(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prime) ).
fof(f4,axiom,
! [X0] :
( less(n1,divisor(X0))
| prime(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor1) ).
fof(f5,axiom,
! [X0] :
( less(divisor(X0),X0)
| prime(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor2) ).
fof(f6,axiom,
! [X0] :
( prime(factor_of(X0))
| ~ less(X0,a)
| ~ less(n1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor1) ).
fof(f7,axiom,
! [X0] :
( divides(factor_of(X0),X0)
| ~ less(X0,a)
| ~ less(n1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor2) ).
fof(f9,negated_conjecture,
! [X0] :
( ~ divides(X0,a)
| ~ prime(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_has_prime_divisor) ).
tcf(c_58,plain,
! [X0: $i] : divides(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( divides(X0,X2)
| ~ divides(X1,X2)
| ~ divides(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_60,plain,
! [X0: $i] :
( prime(X0)
| divides(divisor(X0),X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_61,plain,
! [X0: $i] :
( prime(X0)
| less(n1,divisor(X0)) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_62,plain,
! [X0: $i] :
( prime(X0)
| less(divisor(X0),X0) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_63,plain,
! [X0: $i] :
( prime(factor_of(X0))
| ~ less(n1,X0)
| ~ less(X0,a) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_64,plain,
! [X0: $i] :
( divides(factor_of(X0),X0)
| ~ less(n1,X0)
| ~ less(X0,a) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,negated_conjecture,
! [X0: $i] :
( ~ prime(X0)
| ~ divides(X0,a) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_67,plain,
divides(a,a),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_68,plain,
( prime(a)
| less(divisor(a),a) ),
inference(instantiation,[status(thm)],[c_62]) ).
tcf(c_69,plain,
( prime(a)
| less(n1,divisor(a)) ),
inference(instantiation,[status(thm)],[c_61]) ).
tcf(c_70,plain,
( prime(a)
| divides(divisor(a),a) ),
inference(instantiation,[status(thm)],[c_60]) ).
tcf(c_71,plain,
( ~ prime(a)
| ~ divides(a,a) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_136,plain,
! [X0: $i] :
( ~ less(n1,X0)
| ~ less(X0,a)
| ~ divides(factor_of(X0),a) ),
inference(resolution,[status(thm)],[c_66,c_63]) ).
tcf(c_190,plain,
! [X0: $i] :
( ~ less(n1,X0)
| ~ less(X0,a)
| ~ divides(factor_of(X0),a) ),
inference(demodulation,[status(thm)],[c_136]) ).
tcf(c_196,plain,
( ~ less(n1,divisor(a))
| ~ less(divisor(a),a)
| ~ divides(factor_of(divisor(a)),a) ),
inference(instantiation,[status(thm)],[c_190]) ).
tcf(c_200,plain,
( divides(factor_of(divisor(a)),divisor(a))
| ~ less(n1,divisor(a))
| ~ less(divisor(a),a) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_202,plain,
! [X0: $i] :
( divides(factor_of(divisor(a)),a)
| ~ divides(X0,a)
| ~ divides(factor_of(divisor(a)),X0) ),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_205,plain,
( divides(factor_of(divisor(a)),a)
| ~ divides(divisor(a),a)
| ~ divides(factor_of(divisor(a)),divisor(a)) ),
inference(instantiation,[status(thm)],[c_202]) ).
tcf(c_206,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_205,c_200,c_196,c_71,c_70,c_69,c_68,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM015-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n015.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 02:42:58 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.63/1.28 % SZS status Started for theBenchmark.p
% 1.63/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.63/1.28
% 1.63/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.63/1.28
% 1.63/1.28 % ------ iProver source info
% 1.63/1.28
% 1.63/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.63/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.63/1.28 % git: non_committed_changes: false
% 1.63/1.28
% 1.63/1.28 % ------ Parsing...% successful
% 1.63/1.28
% 1.63/1.28
% 1.63/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.63/1.28
% 1.63/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.63/1.28
% 1.63/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.63/1.28 % ------ Proving...
% 1.63/1.28 % ------ Problem Properties
% 1.63/1.28
% 1.63/1.28 %
% 1.63/1.28 % clauses 8
% 1.63/1.28 % conjectures 0
% 1.63/1.28 % EPR 3
% 1.63/1.28 % Horn 8
% 1.63/1.28 % unary 2
% 1.63/1.28 % binary 3
% 1.63/1.28 % lits 17
% 1.63/1.28 % lits eq 0
% 1.63/1.28 % fd_pure 0
% 1.63/1.28 % fd_pseudo 0
% 1.63/1.28 % fd_cond 0
% 1.63/1.28 % fd_pseudo_cond 0
% 1.63/1.28 % AC symbols 0
% 1.63/1.28
% 1.63/1.28 % ------ Schedule dynamic 5 is on
% 1.63/1.28
% 1.63/1.28 % ------ no conjectures: strip conj schedule
% 1.63/1.28
% 1.63/1.28 % ------ no equalities: superposition off
% 1.63/1.28
% 1.63/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.63/1.28
% 1.63/1.28
% 1.63/1.28 % ------
% 1.63/1.28 % Current options:
% 1.63/1.28 % ------
% 1.63/1.28
% 1.63/1.28
% 1.63/1.28 %
% 1.63/1.28
% 1.63/1.28 % ------ Proving...
% 1.63/1.28 %
% 1.63/1.28
% 1.63/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.63/1.28
% 1.63/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.63/1.28
% 1.63/1.28
%------------------------------------------------------------------------------