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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : CSR043+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 : n013.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:49 EDT 2023

% Result   : Theorem 3.10s 1.67s
% Output   : CNFRefutation 3.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   31 (   4 unt;  26 typ;   0 def)
%            Number of atoms       :    6 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    3 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   21 (  15   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  15 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;  11 con; 0-0 aty)
%            Number of variables   :    0 (;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ isa > genls > genlpreds > genlmt > genlinverse > disjointwith > transitivebinarypredicate > tptpcol_16_30972 > tptpcol_15_30970 > thing > predicate > mtvisible > microtheory > collection > binarypredicate > #nlpp > c_universalvocabularymt > c_transitivebinarypredicate > c_tptpcol_16_30972 > c_tptpcol_15_30970 > c_tptp_spindleheadmt > c_tptp_member2862_mt > 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(genlpreds,type,
    genlpreds: ( $i * $i ) > $o ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_283,negated_conjecture,
    ~ ( mtvisible(c_tptp_member2862_mt)
     => genls(c_tptpcol_16_30972,c_tptpcol_15_30970) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query43) ).

tff(f_45,axiom,
    genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',just6) ).

tff(c_116,plain,
    ~ genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
    inference(cnfTransformation,[status(thm)],[f_283]) ).

tff(c_12,plain,
    genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_119,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_116,c_12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : CSR043+1 : TPTP v8.1.2. Released v3.4.0.
% 0.13/0.14  % 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.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 20:51:17 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 3.10/1.67  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.30/1.67  
% 3.30/1.67  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.36/1.71  
% 3.36/1.71  Inference rules
% 3.36/1.71  ----------------------
% 3.36/1.71  #Ref     : 0
% 3.36/1.71  #Sup     : 0
% 3.36/1.71  #Fact    : 0
% 3.36/1.71  #Define  : 0
% 3.36/1.71  #Split   : 0
% 3.36/1.71  #Chain   : 0
% 3.36/1.71  #Close   : 0
% 3.36/1.71  
% 3.36/1.71  Ordering : KBO
% 3.36/1.71  
% 3.36/1.71  Simplification rules
% 3.36/1.71  ----------------------
% 3.36/1.71  #Subsume      : 58
% 3.36/1.71  #Demod        : 0
% 3.36/1.71  #Tautology    : 0
% 3.36/1.71  #SimpNegUnit  : 1
% 3.36/1.71  #BackRed      : 0
% 3.36/1.71  
% 3.36/1.71  #Partial instantiations: 0
% 3.36/1.71  #Strategies tried      : 1
% 3.36/1.71  
% 3.36/1.71  Timing (in seconds)
% 3.36/1.71  ----------------------
% 3.36/1.71  Preprocessing        : 0.55
% 3.36/1.71  Parsing              : 0.30
% 3.36/1.71  CNF conversion       : 0.04
% 3.36/1.71  Main loop            : 0.13
% 3.36/1.71  Inferencing          : 0.00
% 3.36/1.71  Reduction            : 0.06
% 3.36/1.71  Demodulation         : 0.04
% 3.36/1.71  BG Simplification    : 0.03
% 3.36/1.71  Subsumption          : 0.05
% 3.36/1.71  Abstraction          : 0.01
% 3.36/1.71  MUC search           : 0.00
% 3.36/1.71  Cooper               : 0.00
% 3.36/1.71  Total                : 0.73
% 3.36/1.71  Index Insertion      : 0.00
% 3.36/1.71  Index Deletion       : 0.00
% 3.36/1.71  Index Matching       : 0.00
% 3.36/1.71  BG Taut test         : 0.00
%------------------------------------------------------------------------------