↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM014-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n005.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 2.42s 1.53s
% Output   : CNFRefutation 2.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (  10 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   41 (  19   ~;  22   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   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-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   22 (   0 sgn  22   !;   0   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : product(X0,X0,square(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',square) ).

fof(f3,axiom,
    ! [X2,X0,X1] :
      ( divides(X0,X2)
      | ~ product(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divides) ).

fof(f4,axiom,
    ! [X2,X3,X0,X1] :
      ( divides(X0,X2)
      | divides(X0,X1)
      | ~ divides(X0,X3)
      | ~ product(X1,X2,X3)
      | ~ prime(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',remainder) ).

fof(f5,axiom,
    prime(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_prime) ).

fof(f6,axiom,
    product(a,square(c),square(b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_b_squared_by_c_squared) ).

fof(f7,negated_conjecture,
    ~ divides(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_divides_b) ).

tcf(c_56,plain,
    ! [X0: $i] : product(X0,X0,square(X0)),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_58,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( divides(X0,X2)
      | ~ product(X0,X1,X2) ),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_59,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( divides(X3,X1)
      | divides(X3,X0)
      | ~ prime(X3)
      | ~ divides(X3,X2)
      | ~ product(X0,X1,X2) ),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_60,plain,
    prime(a),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_61,plain,
    product(a,square(c),square(b)),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_62,negated_conjecture,
    ~ divides(a,b),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_91,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( divides(a,X1)
      | divides(a,X0)
      | ~ divides(a,X2)
      | ~ product(X0,X1,X2) ),
    inference(resolution,[status(thm)],[c_59,c_60]) ).

tcf(c_131,plain,
    ( divides(a,square(b))
    | ~ product(a,square(c),square(b)) ),
    inference(instantiation,[status(thm)],[c_58]) ).

tcf(c_136,plain,
    ! [X0: $i,X1: $i] :
      ( divides(a,X1)
      | divides(a,X0)
      | ~ divides(a,square(b))
      | ~ product(X0,X1,square(b)) ),
    inference(instantiation,[status(thm)],[c_91]) ).

tcf(c_144,plain,
    ! [X0: $i] :
      ( divides(a,b)
      | divides(a,X0)
      | ~ divides(a,square(b))
      | ~ product(b,X0,square(b)) ),
    inference(instantiation,[status(thm)],[c_136]) ).

tcf(c_149,plain,
    ( divides(a,b)
    | ~ divides(a,square(b))
    | ~ product(b,b,square(b)) ),
    inference(instantiation,[status(thm)],[c_144]) ).

tcf(c_153,plain,
    product(b,b,square(b)),
    inference(instantiation,[status(thm)],[c_56]) ).

tcf(c_154,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_153,c_149,c_131,c_61,c_62]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : NUM014-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.46  % Computer : n005.cluster.edu
% 0.18/0.46  % Model    : x86_64 x86_64
% 0.18/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46  % Memory   : 8046.5625MB
% 0.18/0.46  % OS       : Linux 6.8.0-71-generic
% 0.18/0.46  % CPULimit : 300
% 0.18/0.46  % WCLimit  : 300
% 0.18/0.46  % DateTime : Thu Sep 24 02:39:33 UTC 2026
% 0.18/0.46  % CPUTime  : 
% 0.18/0.46  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.23/0.52  Running first-order theorem proving
% 0.23/0.52  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.23/0.54  
% 0.23/0.54  % ======== iProver multi-core TPTP/SMT =========
% 0.23/0.54  
% 0.23/0.54  % Detected problem language: tptp
% 0.23/0.56  % Proving...
% 2.42/1.53  % SZS status Started for theBenchmark.p
% 2.42/1.53  % SZS status Unsatisfiable for theBenchmark.p
% 2.42/1.53  
% 2.42/1.53  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.42/1.53  
% 2.42/1.53  % ------  iProver source info
% 2.42/1.53  
% 2.42/1.53  % git: date: 2026-07-19 20:42:38 +0200
% 2.42/1.53  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.42/1.53  % git: non_committed_changes: false
% 2.42/1.53  
% 2.42/1.53  % ------ Parsing...% successful
% 2.42/1.53  
% 2.42/1.53  
% 2.42/1.53  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.42/1.53  
% 2.42/1.53  % ------ 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 % 
% 2.42/1.53  
% 2.42/1.53  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.42/1.53  % ------ Proving...
% 2.42/1.53  % ------ Problem Properties 
% 2.42/1.53  
% 2.42/1.53  % 
% 2.42/1.53  % clauses                               6
% 2.42/1.53  % conjectures                           1
% 2.42/1.53  % EPR                                   4
% 2.42/1.53  % Horn                                  5
% 2.42/1.53  % unary                                 3
% 2.42/1.53  % binary                                2
% 2.42/1.53  % lits                                  11
% 2.42/1.53  % lits eq                               0
% 2.42/1.53  % fd_pure                               0
% 2.42/1.53  % fd_pseudo                             0
% 2.42/1.53  % fd_cond                               0
% 2.42/1.53  % fd_pseudo_cond                        0
% 2.42/1.53  % AC symbols                            0
% 2.42/1.53  
% 2.42/1.53  % ------ Schedule dynamic 5 is on 
% 2.42/1.53  
% 2.42/1.53  % ------ no equalities: superposition off 
% 2.42/1.53  
% 2.42/1.53  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.42/1.53  
% 2.42/1.53  
% 2.42/1.53  % ------ 
% 2.42/1.53  % Current options:
% 2.42/1.53  % ------ 
% 2.42/1.53  
% 2.42/1.53  
% 2.42/1.53  % 
% 2.42/1.53  
% 2.42/1.53  % ------ Proving...
% 2.42/1.53  % 
% 2.42/1.53  
% 2.42/1.53  % SZS status Unsatisfiable for theBenchmark.p
% 2.42/1.53  
% 2.42/1.53  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.42/1.53  
% 2.42/1.53  
%------------------------------------------------------------------------------