↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n008.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:54:14 PM UTC 2026

% Result   : Theorem 0.21s 1.19s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   36 (  10 unt;   0 def)
%            Number of atoms       :   88 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   97 (  45   ~;  37   |;  10   &)
%                                         (   4 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   25 (   0 sgn  21   !;   4   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] :
      ( ~ cowlNothing(X0)
      & cowlThing(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).

fof(f2,axiom,
    ! [X0] :
      ( xsd_string(X0)
    <=> ~ xsd_integer(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).

fof(f3,conjecture,
    ( ! [X0] :
        ( xsd_string(X0)
      <=> ~ xsd_integer(X0) )
    & ! [X0] :
        ( ~ cowlNothing(X0)
        & cowlThing(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_axiom) ).

fof(f4,negated_conjecture,
    ~ ( ! [X0] :
          ( xsd_string(X0)
        <=> ~ xsd_integer(X0) )
      & ! [X0] :
          ( ~ cowlNothing(X0)
          & cowlThing(X0) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

fof(f5,plain,
    ~ ( ! [X1] :
          ( xsd_string(X1)
        <=> ~ xsd_integer(X1) )
      & ! [X0] :
          ( ~ cowlNothing(X0)
          & cowlThing(X0) ) ),
    inference(rectify,[],[f4]) ).

fof(f6,plain,
    ( ? [X1] :
        ( xsd_string(X1)
      <~> ~ xsd_integer(X1) )
    | ? [X0] :
        ( cowlNothing(X0)
        | ~ cowlThing(X0) ) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f7,plain,
    ! [X0] :
      ( ( ~ xsd_string(X0)
        | ~ xsd_integer(X0) )
      & ( xsd_integer(X0)
        | xsd_string(X0) ) ),
    inference(nnf_transformation,[],[f2]) ).

fof(f8,plain,
    ( ? [X1] :
        ( ( xsd_string(X1)
          | ~ xsd_integer(X1) )
        & ( ~ xsd_string(X1)
          | xsd_integer(X1) ) )
    | ? [X0] :
        ( cowlNothing(X0)
        | ~ cowlThing(X0) ) ),
    inference(nnf_transformation,[],[f6]) ).

fof(f9,plain,
    ( ( ( xsd_string(sK1)
        | ~ xsd_integer(sK1) )
      & ( ~ xsd_string(sK1)
        | xsd_integer(sK1) ) )
    | cowlNothing(sK0)
    | ~ cowlThing(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f8]) ).

fof(f10,plain,
    ! [X0] : ~ cowlNothing(X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f11,plain,
    ! [X0] : cowlThing(X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f12,plain,
    ! [X0] :
      ( ~ xsd_string(X0)
      | ~ xsd_integer(X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f13,plain,
    ! [X0] :
      ( xsd_integer(X0)
      | xsd_string(X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f14,plain,
    ( xsd_string(sK1)
    | ~ xsd_integer(sK1)
    | cowlNothing(sK0)
    | ~ cowlThing(sK0) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f15,plain,
    ( ~ xsd_string(sK1)
    | xsd_integer(sK1)
    | cowlNothing(sK0)
    | ~ cowlThing(sK0) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_49,plain,
    ! [X0: $i] : cowlThing(X0),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_50,plain,
    ! [X0: $i] : ~ cowlNothing(X0),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_51,plain,
    ! [X0: $i] :
      ( xsd_integer(X0)
      | xsd_string(X0) ),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_52,plain,
    ! [X0: $i] :
      ( ~ xsd_integer(X0)
      | ~ xsd_string(X0) ),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_53,negated_conjecture,
    ( xsd_integer(sK1)
    | cowlNothing(sK0)
    | ~ xsd_string(sK1)
    | ~ cowlThing(sK0) ),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_54,negated_conjecture,
    ( xsd_string(sK1)
    | cowlNothing(sK0)
    | ~ xsd_integer(sK1)
    | ~ cowlThing(sK0) ),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_55,plain,
    cowlThing(sK0),
    inference(instantiation,[status(thm)],[c_49]) ).

tcf(c_56,plain,
    ~ cowlNothing(sK0),
    inference(instantiation,[status(thm)],[c_50]) ).

tcf(c_59,negated_conjecture,
    ( xsd_string(sK1)
    | ~ xsd_integer(sK1) ),
    inference(global_subsumption_just,[status(thm)],[c_54,c_55,c_56,c_54]) ).

tcf(c_61,negated_conjecture,
    ( xsd_integer(sK1)
    | ~ xsd_string(sK1) ),
    inference(global_subsumption_just,[status(thm)],[c_53,c_55,c_56,c_53]) ).

tcf(c_63,plain,
    ! [X0: $i] :
      ( ~ xsd_string(X0)
      | ~ xsd_integer(X0) ),
    inference(prop_impl_just,[status(thm)],[c_52]) ).

tcf(c_64,plain,
    ! [X0: $i] :
      ( ~ xsd_integer(X0)
      | ~ xsd_string(X0) ),
    inference(renaming,[status(thm)],[c_63]) ).

tcf(c_65,plain,
    ! [X0: $i] :
      ( xsd_string(X0)
      | xsd_integer(X0) ),
    inference(prop_impl_just,[status(thm)],[c_51]) ).

tcf(c_66,plain,
    ! [X0: $i] :
      ( xsd_integer(X0)
      | xsd_string(X0) ),
    inference(renaming,[status(thm)],[c_65]) ).

tcf(c_67,plain,
    ( ~ xsd_string(sK1)
    | xsd_integer(sK1) ),
    inference(prop_impl_just,[status(thm)],[c_61]) ).

tcf(c_68,plain,
    ( xsd_integer(sK1)
    | ~ xsd_string(sK1) ),
    inference(renaming,[status(thm)],[c_67]) ).

tcf(c_69,plain,
    ( xsd_string(sK1)
    | ~ xsd_integer(sK1) ),
    inference(prop_impl_just,[status(thm)],[c_59]) ).

tcf(c_92,plain,
    xsd_integer(sK1),
    inference(backward_subsumption_resolution,[status(thm)],[c_68,c_66]) ).

tcf(c_94,plain,
    xsd_string(sK1),
    inference(backward_subsumption_resolution,[status(thm)],[c_69,c_66]) ).

tcf(c_104,plain,
    ~ xsd_integer(sK1),
    inference(resolution,[status(thm)],[c_64,c_94]) ).

tcf(c_105,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_104,c_92]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS136+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.38  % Computer : n008.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Wed Sep 23 19:29:54 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.42  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.10/0.44  
% 0.10/0.44  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.44  
% 0.10/0.44  % Detected problem language: tptp
% 0.10/0.45  % Proving...
% 0.21/1.19  % SZS status Started for theBenchmark.p
% 0.21/1.19  % SZS status Theorem for theBenchmark.p
% 0.21/1.19  
% 0.21/1.19  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.21/1.19  
% 0.21/1.19  % ------  iProver source info
% 0.21/1.19  
% 0.21/1.19  % git: date: 2026-07-19 20:42:38 +0200
% 0.21/1.19  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.21/1.19  % git: non_committed_changes: false
% 0.21/1.19  
% 0.21/1.19  % ------ Parsing...
% 0.21/1.19  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_non_horn_non_eq
% 0.21/1.19  % 
% 0.21/1.19  
% 0.21/1.19  % ------ Preprocessing... sf_s  rm: 2 0s  sf_e  pe_s % 
% 0.21/1.19  
% 0.21/1.19  % SZS status Theorem for theBenchmark.p
% 0.21/1.19  
% 0.21/1.19  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.21/1.19  
% 0.21/1.19  
%------------------------------------------------------------------------------