↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWV023+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n014.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 03:16:14 PM UTC 2026

% Result   : Theorem 1.33s 1.18s
% Output   : CNFRefutation 1.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   6 unt;   0 def)
%            Number of atoms       :   50 (  16 equ)
%            Maximal formula atoms :   11 (   5 avg)
%            Number of connectives :   57 (  17   ~;  12   |;  20   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    0 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-3 aty)
%            Number of variables   :   12 (   0 sgn  12   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f51,axiom,
    true,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',ttrue) ).

fof(f53,conjecture,
    ( ( ! [X2] :
          ( ( leq(X2,n3)
            & leq(n0,X2) )
         => a_select2(s_values7_init,X2) = init )
      & ! [X0] :
          ( ( leq(X0,n2)
            & leq(n0,X0) )
         => ! [X1] :
              ( ( leq(X1,n3)
                & leq(n0,X1) )
             => a_select3(simplex7_init,X1,X0) = init ) )
      & sigma_init = init
      & i0_init = init )
   => true ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_init_0005) ).

fof(f54,negated_conjecture,
    ~ ( ( ! [X2] :
            ( ( leq(X2,n3)
              & leq(n0,X2) )
           => a_select2(s_values7_init,X2) = init )
        & ! [X0] :
            ( ( leq(X0,n2)
              & leq(n0,X0) )
           => ! [X1] :
                ( ( leq(X1,n3)
                  & leq(n0,X1) )
               => a_select3(simplex7_init,X1,X0) = init ) )
        & sigma_init = init
        & i0_init = init )
     => true ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f135,plain,
    ( ! [X2] :
        ( ~ leq(X2,n3)
        | ~ leq(n0,X2)
        | a_select2(s_values7_init,X2) = init )
    & ! [X0] :
        ( ~ leq(X0,n2)
        | ~ leq(n0,X0)
        | ! [X1] :
            ( ~ leq(X1,n3)
            | ~ leq(n0,X1)
            | a_select3(simplex7_init,X1,X0) = init ) )
    & sigma_init = init
    & i0_init = init
    & ~ true ),
    inference(ennf_transformation,[],[f54]) ).

fof(f136,plain,
    ( ! [X2] :
        ( ~ leq(X2,n3)
        | ~ leq(n0,X2)
        | a_select2(s_values7_init,X2) = init )
    & ! [X0] :
        ( ~ leq(X0,n2)
        | ~ leq(n0,X0)
        | ! [X1] :
            ( ~ leq(X1,n3)
            | ~ leq(n0,X1)
            | a_select3(simplex7_init,X1,X0) = init ) )
    & sigma_init = init
    & i0_init = init
    & ~ true ),
    inference(flattening,[],[f135]) ).

fof(f298,plain,
    true,
    inference(cnf_transformation,[],[f51]) ).

fof(f304,plain,
    ~ true,
    inference(cnf_transformation,[],[f136]) ).

tcf(c_156,plain,
    true,
    inference(cnf_transformation,[],[f298]) ).

tcf(c_158,negated_conjecture,
    ~ true,
    inference(cnf_transformation,[],[f304]) ).

tcf(c_193,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_158,c_156]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV023+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n014.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Thu Sep 24 18:21:03 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41  Running first-order theorem proving
% 0.09/0.41  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.09/0.42  
% 0.09/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42  
% 0.09/0.42  % Detected problem language: tptp
% 0.09/0.43  % Proving...
% 1.33/1.18  % SZS status Started for theBenchmark.p
% 1.33/1.18  % SZS status Theorem for theBenchmark.p
% 1.33/1.18  
% 1.33/1.18  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.33/1.18  
% 1.33/1.18  % ------  iProver source info
% 1.33/1.18  
% 1.33/1.18  % git: date: 2026-07-19 20:42:38 +0200
% 1.33/1.18  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.33/1.18  % git: non_committed_changes: false
% 1.33/1.18  
% 1.33/1.18  % ------ Parsing...
% 1.33/1.18  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.33/1.18  
% 1.33/1.18  % ------ Preprocessing...% 
% 1.33/1.18  
% 1.33/1.18  % SZS status Theorem for theBenchmark.p
% 1.33/1.18  
% 1.33/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.33/1.18  
% 1.33/1.18  
%------------------------------------------------------------------------------