TSTP Solution File: KRS105+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : KRS105+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n031.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May  3 02:33:38 EDT 2024

% Result   : Unsatisfiable 0.90s 1.17s
% Output   : CNFRefutation 0.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   51 (   8 unt;   0 def)
%            Number of atoms       :  104 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   93 (  40   ~;  33   |;   4   &)
%                                         (   4 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   57 (   1 sgn  37   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
     => cdxcomp(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(f4,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
     => cc(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

fof(f5,axiom,
    ! [X0] :
      ( cc(X0)
     => ! [X1] :
          ( rr(X0,X1)
         => cc(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

fof(f6,axiom,
    ! [X0] :
      ( cd(X0)
    <=> ~ ? [X1] : ra_Px1(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

fof(f7,axiom,
    ! [X0] :
      ( cdxcomp(X0)
    <=> ? [X2] : ra_Px1(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

fof(f8,axiom,
    ! [X0] :
      ( ca_Ax2(X0)
    <=> ! [X1] :
          ( rr(X0,X1)
         => cc(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).

fof(f9,axiom,
    ! [X0] :
      ( ca_Ax2(X0)
     => cd(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).

fof(f10,axiom,
    cUnsatisfiable(i2003_11_14_17_20_53634),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).

fof(f11,plain,
    ! [X0] :
      ( cdxcomp(X0)
    <=> ? [X1] : ra_Px1(X0,X1) ),
    inference(rectify,[],[f7]) ).

fof(f12,plain,
    ! [X0] :
      ( ! [X1] :
          ( rr(X0,X1)
         => cc(X1) )
     => ca_Ax2(X0) ),
    inference(unused_predicate_definition_removal,[],[f8]) ).

fof(f13,plain,
    ! [X0] :
      ( cd(X0)
     => ~ ? [X1] : ra_Px1(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f6]) ).

fof(f14,plain,
    ! [X0] :
      ( cdxcomp(X0)
     => ? [X1] : ra_Px1(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f11]) ).

fof(f17,plain,
    ! [X0] :
      ( cdxcomp(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f18,plain,
    ! [X0] :
      ( cc(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f19,plain,
    ! [X0] :
      ( ! [X1] :
          ( cc(X1)
          | ~ rr(X0,X1) )
      | ~ cc(X0) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f20,plain,
    ! [X0] :
      ( ! [X1] : ~ ra_Px1(X0,X1)
      | ~ cd(X0) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f21,plain,
    ! [X0] :
      ( ? [X1] : ra_Px1(X0,X1)
      | ~ cdxcomp(X0) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f22,plain,
    ! [X0] :
      ( ca_Ax2(X0)
      | ? [X1] :
          ( ~ cc(X1)
          & rr(X0,X1) ) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f23,plain,
    ! [X0] :
      ( cd(X0)
      | ~ ca_Ax2(X0) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f24,plain,
    ! [X0] :
      ( ? [X1] : ra_Px1(X0,X1)
     => ra_Px1(X0,sK0(X0)) ),
    introduced(choice_axiom,[]) ).

fof(f25,plain,
    ! [X0] :
      ( ra_Px1(X0,sK0(X0))
      | ~ cdxcomp(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f21,f24]) ).

fof(f26,plain,
    ! [X0] :
      ( ? [X1] :
          ( ~ cc(X1)
          & rr(X0,X1) )
     => ( ~ cc(sK1(X0))
        & rr(X0,sK1(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f27,plain,
    ! [X0] :
      ( ca_Ax2(X0)
      | ( ~ cc(sK1(X0))
        & rr(X0,sK1(X0)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f22,f26]) ).

fof(f28,plain,
    ! [X0] :
      ( cdxcomp(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f29,plain,
    ! [X0] :
      ( cc(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f30,plain,
    ! [X0,X1] :
      ( cc(X1)
      | ~ rr(X0,X1)
      | ~ cc(X0) ),
    inference(cnf_transformation,[],[f19]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( ~ ra_Px1(X0,X1)
      | ~ cd(X0) ),
    inference(cnf_transformation,[],[f20]) ).

fof(f32,plain,
    ! [X0] :
      ( ra_Px1(X0,sK0(X0))
      | ~ cdxcomp(X0) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f33,plain,
    ! [X0] :
      ( ca_Ax2(X0)
      | rr(X0,sK1(X0)) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f34,plain,
    ! [X0] :
      ( ca_Ax2(X0)
      | ~ cc(sK1(X0)) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f35,plain,
    ! [X0] :
      ( cd(X0)
      | ~ ca_Ax2(X0) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f36,plain,
    cUnsatisfiable(i2003_11_14_17_20_53634),
    inference(cnf_transformation,[],[f10]) ).

cnf(c_49,plain,
    ( ~ cUnsatisfiable(X0)
    | cdxcomp(X0) ),
    inference(cnf_transformation,[],[f28]) ).

cnf(c_50,plain,
    ( ~ cUnsatisfiable(X0)
    | cc(X0) ),
    inference(cnf_transformation,[],[f29]) ).

cnf(c_51,plain,
    ( ~ rr(X0,X1)
    | ~ cc(X0)
    | cc(X1) ),
    inference(cnf_transformation,[],[f30]) ).

cnf(c_52,plain,
    ( ~ ra_Px1(X0,X1)
    | ~ cd(X0) ),
    inference(cnf_transformation,[],[f31]) ).

cnf(c_53,plain,
    ( ~ cdxcomp(X0)
    | ra_Px1(X0,sK0(X0)) ),
    inference(cnf_transformation,[],[f32]) ).

cnf(c_54,plain,
    ( ~ cc(sK1(X0))
    | ca_Ax2(X0) ),
    inference(cnf_transformation,[],[f34]) ).

cnf(c_55,plain,
    ( rr(X0,sK1(X0))
    | ca_Ax2(X0) ),
    inference(cnf_transformation,[],[f33]) ).

cnf(c_56,plain,
    ( ~ ca_Ax2(X0)
    | cd(X0) ),
    inference(cnf_transformation,[],[f35]) ).

cnf(c_57,plain,
    cUnsatisfiable(i2003_11_14_17_20_53634),
    inference(cnf_transformation,[],[f36]) ).

cnf(c_58,plain,
    ( ~ ca_Ax2(i2003_11_14_17_20_53634)
    | cd(i2003_11_14_17_20_53634) ),
    inference(instantiation,[status(thm)],[c_56]) ).

cnf(c_59,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_20_53634)
    | cc(i2003_11_14_17_20_53634) ),
    inference(instantiation,[status(thm)],[c_50]) ).

cnf(c_62,plain,
    ( ~ cc(sK1(i2003_11_14_17_20_53634))
    | ca_Ax2(i2003_11_14_17_20_53634) ),
    inference(instantiation,[status(thm)],[c_54]) ).

cnf(c_101,plain,
    ( ~ cUnsatisfiable(X0)
    | ra_Px1(X0,sK0(X0)) ),
    inference(resolution,[status(thm)],[c_49,c_53]) ).

cnf(c_111,plain,
    ra_Px1(i2003_11_14_17_20_53634,sK0(i2003_11_14_17_20_53634)),
    inference(resolution,[status(thm)],[c_101,c_57]) ).

cnf(c_121,plain,
    ~ cd(i2003_11_14_17_20_53634),
    inference(resolution,[status(thm)],[c_52,c_111]) ).

cnf(c_126,plain,
    ~ ca_Ax2(i2003_11_14_17_20_53634),
    inference(resolution,[status(thm)],[c_56,c_121]) ).

cnf(c_131,plain,
    rr(i2003_11_14_17_20_53634,sK1(i2003_11_14_17_20_53634)),
    inference(resolution,[status(thm)],[c_55,c_126]) ).

cnf(c_141,plain,
    ( ~ cc(i2003_11_14_17_20_53634)
    | cc(sK1(i2003_11_14_17_20_53634)) ),
    inference(resolution,[status(thm)],[c_51,c_131]) ).

cnf(c_142,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_141,c_121,c_62,c_59,c_58,c_57]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KRS105+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n031.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu May  2 23:15:46 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.90/1.17  % SZS status Started for theBenchmark.p
% 0.90/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 0.90/1.17  
% 0.90/1.17  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.90/1.17  
% 0.90/1.17  ------  iProver source info
% 0.90/1.17  
% 0.90/1.17  git: date: 2024-05-02 19:28:25 +0000
% 0.90/1.17  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.90/1.17  git: non_committed_changes: false
% 0.90/1.17  
% 0.90/1.17  ------ Parsing...
% 0.90/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.90/1.17  
% 0.90/1.17  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s
% 0.90/1.17  
% 0.90/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 0.90/1.17  
% 0.90/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.90/1.17  
% 0.90/1.17  
%------------------------------------------------------------------------------