↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n018.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:17:33 PM UTC 2026

% Result   : Theorem 1.27s 1.32s
% Output   : CNFRefutation 1.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   6 unt;   0 def)
%            Number of atoms       :   27 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   23 (   9   ~;   0   |;  11   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   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  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   26 (   2 sgn  17   !;   9   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f10,axiom,
    ! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax22) ).

fof(f19,conjecture,
    ! [X0,X1,X2,X3] :
      ( ( less_than(X3,X2)
        & pair_in_list(create_slb,X1,X2) )
     => pair_in_list(update_slb(create_slb,X3),X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l36_co) ).

fof(f20,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ( less_than(X3,X2)
          & pair_in_list(create_slb,X1,X2) )
       => pair_in_list(update_slb(create_slb,X3),X1,X2) ),
    inference(negated_conjecture,[status(cth)],[f19]) ).

fof(f21,plain,
    ~ ! [X1,X2,X3] :
        ( ( less_than(X3,X2)
          & pair_in_list(create_slb,X1,X2) )
       => pair_in_list(update_slb(create_slb,X3),X1,X2) ),
    inference(rectify,[],[f20]) ).

fof(f33,plain,
    ? [X1,X2,X3] :
      ( less_than(X3,X2)
      & pair_in_list(create_slb,X1,X2)
      & ~ pair_in_list(update_slb(create_slb,X3),X1,X2) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f34,plain,
    ? [X1,X2,X3] :
      ( less_than(X3,X2)
      & pair_in_list(create_slb,X1,X2)
      & ~ pair_in_list(update_slb(create_slb,X3),X1,X2) ),
    inference(flattening,[],[f33]) ).

fof(f39,plain,
    ? [X0,X1,X2] :
      ( less_than(X2,X1)
      & pair_in_list(create_slb,X0,X1)
      & ~ pair_in_list(update_slb(create_slb,X2),X0,X1) ),
    inference(rectify,[],[f34]) ).

fof(f40,plain,
    ( less_than(sK2,sK1)
    & pair_in_list(create_slb,sK0,sK1)
    & ~ pair_in_list(update_slb(create_slb,sK2),sK0,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f39]) ).

fof(f52,plain,
    ! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
    inference(cnf_transformation,[],[f10]) ).

fof(f65,plain,
    pair_in_list(create_slb,sK0,sK1),
    inference(cnf_transformation,[],[f40]) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i] : ~ pair_in_list(create_slb,X0,X1),
    inference(cnf_transformation,[],[f52]) ).

tcf(c_73,negated_conjecture,
    pair_in_list(create_slb,sK0,sK1),
    inference(cnf_transformation,[],[f65]) ).

tcf(c_102,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_73,c_60]) ).


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