↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n019.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 01:53:59 PM UTC 2026

% Result   : Unsatisfiable 0.45s 1.29s
% Output   : CNFRefutation 0.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   32 (   5 unt;   0 def)
%            Number of atoms       :   69 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   80 (  43   ~;  37   |;   0   &)
%                                         (   0 <=>;   0  =>;   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  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   28 (   0 sgn  28   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    e(exist),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

fof(f2,negated_conjecture,
    f(exist),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

fof(f3,axiom,
    ! [X0] :
      ( ~ c(X0)
      | s2least(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

fof(f5,axiom,
    ! [X0] :
      ( ~ equalish(u1r2(X0),u1r1(X0))
      | ~ s2least(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

fof(f6,axiom,
    ! [X0] :
      ( ~ s2least(X0)
      | s(X0,u1r1(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ s2least(X0)
      | s(X0,u1r2(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

fof(f9,axiom,
    ! [X0] :
      ( ~ d(X0)
      | s1most(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).

fof(f11,axiom,
    ! [X2,X0,X1] :
      ( ~ s(X2,X1)
      | ~ s(X2,X0)
      | ~ s1most(X2)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).

fof(f15,axiom,
    ! [X0] :
      ( ~ e(X0)
      | c(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).

fof(f16,axiom,
    ! [X0] :
      ( ~ f(X0)
      | d(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).

tcf(c_65,negated_conjecture,
    e(exist),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_66,negated_conjecture,
    f(exist),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_67,plain,
    ! [X0: $i] :
      ( s2least(X0)
      | ~ c(X0) ),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_69,plain,
    ! [X0: $i] :
      ( ~ s2least(X0)
      | ~ equalish(u1r2(X0),u1r1(X0)) ),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_70,plain,
    ! [X0: $i] :
      ( s(X0,u1r1(X0))
      | ~ s2least(X0) ),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_71,plain,
    ! [X0: $i] :
      ( s(X0,u1r2(X0))
      | ~ s2least(X0) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_73,plain,
    ! [X0: $i] :
      ( s1most(X0)
      | ~ d(X0) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_75,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( equalish(X2,X1)
      | ~ s1most(X0)
      | ~ s(X0,X2)
      | ~ s(X0,X1) ),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_79,plain,
    ! [X0: $i] :
      ( c(X0)
      | ~ e(X0) ),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_80,plain,
    ! [X0: $i] :
      ( d(X0)
      | ~ f(X0) ),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_81,plain,
    ( d(exist)
    | ~ f(exist) ),
    inference(instantiation,[status(thm)],[c_80]) ).

tcf(c_82,plain,
    ( c(exist)
    | ~ e(exist) ),
    inference(instantiation,[status(thm)],[c_79]) ).

tcf(c_86,plain,
    ( s2least(exist)
    | ~ c(exist) ),
    inference(instantiation,[status(thm)],[c_67]) ).

tcf(c_89,plain,
    ( s(exist,u1r2(exist))
    | ~ s2least(exist) ),
    inference(instantiation,[status(thm)],[c_71]) ).

tcf(c_90,plain,
    ( s(exist,u1r1(exist))
    | ~ s2least(exist) ),
    inference(instantiation,[status(thm)],[c_70]) ).

tcf(c_101,plain,
    ! [X0: $i] :
      ( s1most(X0)
      | ~ d(X0) ),
    inference(prop_impl_just,[status(thm)],[c_73]) ).

tcf(c_103,plain,
    ! [X0: $i] :
      ( ~ equalish(u1r2(X0),u1r1(X0))
      | ~ c(X0) ),
    inference(prop_impl_just,[status(thm)],[c_67,c_69]) ).

tcf(c_104,plain,
    ! [X0: $i] :
      ( ~ c(X0)
      | ~ equalish(u1r2(X0),u1r1(X0)) ),
    inference(renaming,[status(thm)],[c_103]) ).

tcf(c_162,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( equalish(X2,X1)
      | ~ d(X0)
      | ~ s(X0,X2)
      | ~ s(X0,X1) ),
    inference(bin_hyper_res,[status(thm)],[c_75,c_101]) ).

tcf(c_401,plain,
    ! [X0: $i,X1: $i] :
      ( ~ d(X0)
      | ~ c(X1)
      | ~ s(X0,u1r1(X1))
      | ~ s(X0,u1r2(X1)) ),
    inference(resolution,[status(thm)],[c_104,c_162]) ).

tcf(c_402,plain,
    ( ~ d(exist)
    | ~ c(exist)
    | ~ s(exist,u1r1(exist))
    | ~ s(exist,u1r2(exist)) ),
    inference(instantiation,[status(thm)],[c_401]) ).

tcf(c_403,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_402,c_90,c_89,c_86,c_82,c_81,c_65,c_66]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS003-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37  % Computer : n019.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 : Wed Sep 23 19:14:04 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/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.15/0.42  
% 0.15/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.42  
% 0.15/0.42  % Detected problem language: tptp
% 0.15/0.44  % Proving...
% 0.45/1.29  % SZS status Started for theBenchmark.p
% 0.45/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.29  
% 0.45/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.45/1.29  
% 0.45/1.29  % ------  iProver source info
% 0.45/1.29  
% 0.45/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 0.45/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.45/1.29  % git: non_committed_changes: false
% 0.45/1.29  
% 0.45/1.29  % ------ Parsing...% successful
% 0.45/1.29  
% 0.45/1.29  
% 0.45/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.45/1.29  
% 0.45/1.29  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s% 
% 0.45/1.29  
% 0.45/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.29  
% 0.45/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.29  
% 0.45/1.29  
%------------------------------------------------------------------------------