TSTP Solution File: CSR030+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : CSR030+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n018.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 Aug 22 10:35:39 EDT 2023

% Result   : Theorem 4.22s 1.99s
% Output   : CNFRefutation 4.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   39
% Syntax   : Number of formulae    :   54 (  11 unt;  33 typ;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (   9   ~;   6   |;   1   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   28 (  19   >;   9   *;   0   +;   0  <<)
%            Number of predicates  :   20 (  19 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;  14 con; 0-0 aty)
%            Number of variables   :   14 (;  13   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ tptptypes_7_389 > tptptypes_6_388 > tptptypes_5_387 > isa > genls > genlpreds > genlmt > genlinverse > disjointwith > transitivebinarypredicate > tptpcol_16_4451 > thing > pushingwithopenhand > predicate > mtvisible > microtheory > firstordercollection > collection > binarypredicate > #nlpp > c_universalvocabularymt > c_transitivebinarypredicate > c_tptptypes_7_389 > c_tptptypes_6_388 > c_tptptypes_5_387 > c_tptpcol_16_4451 > c_tptp_spindleheadmt > c_tptp_member3393_mt > c_pushingwithopenhand > c_genlmt > c_cyclistsmt > c_calendarsvocabularymt > c_calendarsmt > c_basekb

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(mtvisible,type,
    mtvisible: $i > $o ).

tff(microtheory,type,
    microtheory: $i > $o ).

tff(genls,type,
    genls: ( $i * $i ) > $o ).

tff(firstordercollection,type,
    firstordercollection: $i > $o ).

tff(genlpreds,type,
    genlpreds: ( $i * $i ) > $o ).

tff(collection,type,
    collection: $i > $o ).

tff(c_tptpcol_16_4451,type,
    c_tptpcol_16_4451: $i ).

tff(tptptypes_6_388,type,
    tptptypes_6_388: ( $i * $i ) > $o ).

tff(binarypredicate,type,
    binarypredicate: $i > $o ).

tff(c_calendarsmt,type,
    c_calendarsmt: $i ).

tff(genlmt,type,
    genlmt: ( $i * $i ) > $o ).

tff(c_tptptypes_7_389,type,
    c_tptptypes_7_389: $i ).

tff(c_tptptypes_6_388,type,
    c_tptptypes_6_388: $i ).

tff(c_genlmt,type,
    c_genlmt: $i ).

tff(c_tptp_member3393_mt,type,
    c_tptp_member3393_mt: $i ).

tff(isa,type,
    isa: ( $i * $i ) > $o ).

tff(c_transitivebinarypredicate,type,
    c_transitivebinarypredicate: $i ).

tff(c_tptptypes_5_387,type,
    c_tptptypes_5_387: $i ).

tff(predicate,type,
    predicate: $i > $o ).

tff(c_cyclistsmt,type,
    c_cyclistsmt: $i ).

tff(c_calendarsvocabularymt,type,
    c_calendarsvocabularymt: $i ).

tff(disjointwith,type,
    disjointwith: ( $i * $i ) > $o ).

tff(thing,type,
    thing: $i > $o ).

tff(tptpcol_16_4451,type,
    tptpcol_16_4451: $i > $o ).

tff(c_tptp_spindleheadmt,type,
    c_tptp_spindleheadmt: $i ).

tff(c_basekb,type,
    c_basekb: $i ).

tff(tptptypes_7_389,type,
    tptptypes_7_389: ( $i * $i ) > $o ).

tff(c_universalvocabularymt,type,
    c_universalvocabularymt: $i ).

tff(tptptypes_5_387,type,
    tptptypes_5_387: ( $i * $i ) > $o ).

tff(transitivebinarypredicate,type,
    transitivebinarypredicate: $i > $o ).

tff(c_pushingwithopenhand,type,
    c_pushingwithopenhand: $i ).

tff(genlinverse,type,
    genlinverse: ( $i * $i ) > $o ).

tff(pushingwithopenhand,type,
    pushingwithopenhand: $i > $o ).

tff(f_278,negated_conjecture,
    ~ ? [ARG2] :
        ( mtvisible(c_tptp_member3393_mt)
       => tptptypes_5_387(ARG2,c_pushingwithopenhand) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query30) ).

tff(f_63,axiom,
    ( mtvisible(c_tptp_spindleheadmt)
   => tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',just12) ).

tff(f_59,axiom,
    genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',just11) ).

tff(f_241,axiom,
    ! [SPECMT,GENLMT] :
      ( ( mtvisible(SPECMT)
        & genlmt(SPECMT,GENLMT) )
     => mtvisible(GENLMT) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',just49) ).

tff(f_55,axiom,
    ! [ARG1,ARG2] :
      ( tptptypes_7_389(ARG1,ARG2)
     => tptptypes_6_388(ARG2,ARG1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',just9) ).

tff(f_49,axiom,
    ! [ARG1,ARG2] :
      ( tptptypes_6_388(ARG1,ARG2)
     => tptptypes_5_387(ARG1,ARG2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',just7) ).

tff(c_118,plain,
    ! [ARG2_90] : ~ tptptypes_5_387(ARG2_90,c_pushingwithopenhand),
    inference(cnfTransformation,[status(thm)],[f_278]) ).

tff(c_24,plain,
    ( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
    | ~ mtvisible(c_tptp_spindleheadmt) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_120,plain,
    ~ mtvisible(c_tptp_spindleheadmt),
    inference(splitLeft,[status(thm)],[c_24]) ).

tff(c_116,plain,
    mtvisible(c_tptp_member3393_mt),
    inference(cnfTransformation,[status(thm)],[f_278]) ).

tff(c_22,plain,
    genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_284,plain,
    ! [GENLMT_144,SPECMT_145] :
      ( mtvisible(GENLMT_144)
      | ~ genlmt(SPECMT_145,GENLMT_144)
      | ~ mtvisible(SPECMT_145) ),
    inference(cnfTransformation,[status(thm)],[f_241]) ).

tff(c_293,plain,
    ( mtvisible(c_tptp_spindleheadmt)
    | ~ mtvisible(c_tptp_member3393_mt) ),
    inference(resolution,[status(thm)],[c_22,c_284]) ).

tff(c_310,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(demodulation,[status(thm),theory(equality)],[c_116,c_293]) ).

tff(c_312,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_120,c_310]) ).

tff(c_313,plain,
    tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451),
    inference(splitRight,[status(thm)],[c_24]) ).

tff(c_489,plain,
    ! [ARG2_196,ARG1_197] :
      ( tptptypes_6_388(ARG2_196,ARG1_197)
      | ~ tptptypes_7_389(ARG1_197,ARG2_196) ),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_493,plain,
    tptptypes_6_388(c_tptpcol_16_4451,c_pushingwithopenhand),
    inference(resolution,[status(thm)],[c_313,c_489]) ).

tff(c_14,plain,
    ! [ARG1_1,ARG2_2] :
      ( tptptypes_5_387(ARG1_1,ARG2_2)
      | ~ tptptypes_6_388(ARG1_1,ARG2_2) ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_496,plain,
    tptptypes_5_387(c_tptpcol_16_4451,c_pushingwithopenhand),
    inference(resolution,[status(thm)],[c_493,c_14]) ).

tff(c_506,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_118,c_496]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : CSR030+1 : TPTP v8.1.2. Released v3.4.0.
% 0.00/0.15  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.37  % Computer : n018.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu Aug  3 21:19:35 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 4.22/1.99  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.22/1.99  
% 4.22/1.99  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.33/2.02  
% 4.33/2.02  Inference rules
% 4.33/2.02  ----------------------
% 4.33/2.02  #Ref     : 0
% 4.33/2.02  #Sup     : 72
% 4.33/2.02  #Fact    : 0
% 4.33/2.02  #Define  : 0
% 4.33/2.02  #Split   : 7
% 4.33/2.02  #Chain   : 0
% 4.33/2.02  #Close   : 0
% 4.33/2.02  
% 4.33/2.02  Ordering : KBO
% 4.33/2.02  
% 4.33/2.02  Simplification rules
% 4.33/2.02  ----------------------
% 4.33/2.02  #Subsume      : 21
% 4.33/2.02  #Demod        : 11
% 4.33/2.02  #Tautology    : 24
% 4.33/2.02  #SimpNegUnit  : 10
% 4.33/2.02  #BackRed      : 7
% 4.33/2.02  
% 4.33/2.02  #Partial instantiations: 0
% 4.33/2.02  #Strategies tried      : 1
% 4.33/2.02  
% 4.33/2.02  Timing (in seconds)
% 4.33/2.02  ----------------------
% 4.33/2.02  Preprocessing        : 0.54
% 4.33/2.02  Parsing              : 0.31
% 4.33/2.02  CNF conversion       : 0.04
% 4.33/2.02  Main loop            : 0.42
% 4.33/2.02  Inferencing          : 0.16
% 4.33/2.02  Reduction            : 0.11
% 4.33/2.02  Demodulation         : 0.08
% 4.33/2.02  BG Simplification    : 0.03
% 4.33/2.02  Subsumption          : 0.07
% 4.33/2.02  Abstraction          : 0.01
% 4.33/2.02  MUC search           : 0.00
% 4.33/2.02  Cooper               : 0.00
% 4.33/2.02  Total                : 1.01
% 4.33/2.02  Index Insertion      : 0.00
% 4.33/2.02  Index Deletion       : 0.00
% 4.33/2.02  Index Matching       : 0.00
% 4.33/2.02  BG Taut test         : 0.00
%------------------------------------------------------------------------------