↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : KRS137+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n002.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 : Tue May  5 04:36:35 PM UTC 2026

% Result   : Theorem 1.25s 1.71s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   34 (   9 unt;   0 def)
%            Number of atoms       :  113 (   0 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  145 (  66   ~;  56   |;  18   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   18 (   2 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
    ( ! [X1] :
        ( cowlThing(X1)
        & ~ cowlNothing(X1) )
    & ! [X1] :
        ( xsd_string(X1)
      <=> ~ xsd_integer(X1) )
    & cCar(iauto)
    & cowlThing(iauto)
    & cowlThing(icar)
    & cAutomobile(icar) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).

fof(axiom_0,axiom,
    ! [X1] :
      ( cowlThing(X1)
      & ~ cowlNothing(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).

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

fof(axiom_2,axiom,
    ! [X1] :
      ( cCar(X1)
    <=> cAutomobile(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_4,axiom,
    cAutomobile(iauto),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

fof(axiom_6,axiom,
    cCar(icar),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

fof(c_0_6,negated_conjecture,
    ~ ( ! [X1] :
          ( cowlThing(X1)
          & ~ cowlNothing(X1) )
      & ! [X1] :
          ( xsd_string(X1)
        <=> ~ xsd_integer(X1) )
      & cCar(iauto)
      & cowlThing(iauto)
      & cowlThing(icar)
      & cAutomobile(icar) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).

fof(c_0_7,plain,
    ! [X1] :
      ( cowlThing(X1)
      & ~ cowlNothing(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_0]) ).

fof(c_0_8,negated_conjecture,
    ( ( ~ xsd_string(esk2_0)
      | xsd_integer(esk2_0)
      | ~ cowlThing(esk1_0)
      | cowlNothing(esk1_0)
      | ~ cCar(iauto)
      | ~ cowlThing(iauto)
      | ~ cowlThing(icar)
      | ~ cAutomobile(icar) )
    & ( xsd_string(esk2_0)
      | ~ xsd_integer(esk2_0)
      | ~ cowlThing(esk1_0)
      | cowlNothing(esk1_0)
      | ~ cCar(iauto)
      | ~ cowlThing(iauto)
      | ~ cowlThing(icar)
      | ~ cAutomobile(icar) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

fof(c_0_9,plain,
    ! [X7] :
      ( cowlThing(X7)
      & ~ cowlNothing(X7) ),
    inference(variable_rename,[status(thm)],[c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    ( xsd_string(esk2_0)
    | cowlNothing(esk1_0)
    | ~ xsd_integer(esk2_0)
    | ~ cowlThing(esk1_0)
    | ~ cCar(iauto)
    | ~ cowlThing(iauto)
    | ~ cowlThing(icar)
    | ~ cAutomobile(icar) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    cowlThing(X1),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_12,plain,
    ! [X1] :
      ( xsd_string(X1)
    <=> ~ xsd_integer(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_1]) ).

cnf(c_0_13,negated_conjecture,
    ( xsd_integer(esk2_0)
    | cowlNothing(esk1_0)
    | ~ xsd_string(esk2_0)
    | ~ cowlThing(esk1_0)
    | ~ cCar(iauto)
    | ~ cowlThing(iauto)
    | ~ cowlThing(icar)
    | ~ cAutomobile(icar) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ( cowlNothing(esk1_0)
    | xsd_string(esk2_0)
    | ~ xsd_integer(esk2_0)
    | ~ cCar(iauto)
    | ~ cAutomobile(icar) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11])]) ).

cnf(c_0_15,plain,
    ~ cowlNothing(X1),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_16,plain,
    ! [X8] :
      ( ( ~ xsd_string(X8)
        | ~ xsd_integer(X8) )
      & ( xsd_integer(X8)
        | xsd_string(X8) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).

fof(c_0_17,plain,
    ! [X9] :
      ( ( ~ cCar(X9)
        | cAutomobile(X9) )
      & ( ~ cAutomobile(X9)
        | cCar(X9) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])]) ).

cnf(c_0_18,negated_conjecture,
    ( cowlNothing(esk1_0)
    | xsd_integer(esk2_0)
    | ~ xsd_string(esk2_0)
    | ~ cCar(iauto)
    | ~ cAutomobile(icar) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_11]),c_0_11])]) ).

cnf(c_0_19,negated_conjecture,
    ( xsd_string(esk2_0)
    | ~ cAutomobile(icar)
    | ~ cCar(iauto)
    | ~ xsd_integer(esk2_0) ),
    inference(sr,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,plain,
    ( ~ xsd_string(X1)
    | ~ xsd_integer(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,plain,
    ( cCar(X1)
    | ~ cAutomobile(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_22,plain,
    cAutomobile(iauto),
    inference(split_conjunct,[status(thm)],[axiom_4]) ).

cnf(c_0_23,negated_conjecture,
    ( xsd_integer(esk2_0)
    | ~ cAutomobile(icar)
    | ~ cCar(iauto)
    | ~ xsd_string(esk2_0) ),
    inference(sr,[status(thm)],[c_0_18,c_0_15]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ cAutomobile(icar)
    | ~ cCar(iauto)
    | ~ xsd_integer(esk2_0) ),
    inference(csr,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,plain,
    cCar(iauto),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ cAutomobile(icar)
    | ~ cCar(iauto)
    | ~ xsd_string(esk2_0) ),
    inference(csr,[status(thm)],[c_0_23,c_0_20]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ cAutomobile(icar)
    | ~ xsd_integer(esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).

cnf(c_0_28,plain,
    ( xsd_integer(X1)
    | xsd_string(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ cAutomobile(icar)
    | ~ xsd_string(esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_25])]) ).

cnf(c_0_30,negated_conjecture,
    ~ cAutomobile(icar),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).

cnf(c_0_31,plain,
    ( cAutomobile(X1)
    | ~ cCar(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_32,plain,
    cCar(icar),
    inference(split_conjunct,[status(thm)],[axiom_6]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS137+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32  % Computer : n002.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Mon May  4 20:38:31 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.25/1.71  % Version  : CSE_E---1.7
% 1.25/1.71  % Problem  : theBenchmark.p
% 1.25/1.71  % SZS status Theorem for theBenchmark.p
% 1.25/1.71  % SZS output start CNFRefutation
% See solution above
% 1.25/1.71  % Total time : 1.372s
%------------------------------------------------------------------------------