↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : CSR025+1 : TPTP v9.0.0. 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 : n029.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 : Wed Apr  9 05:53:23 PM UTC 2025

% Result   : Theorem 3.46s 1.72s
% Output   : CNFRefutation 3.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    5 (   4 unt;   0 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  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  15 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ isa > genls > genlpreds > genlmt > genlinverse > disjointwith > transitivebinarypredicate > tptpcol_16_130933 > tptpcol_15_130931 > thing > predicate > mtvisible > microtheory > collection > binarypredicate > #nlpp > c_universalvocabularymt > c_transitivebinarypredicate > c_tptpcol_16_130933 > c_tptpcol_15_130931 > c_patterndetectormt > c_genlmt > 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(tptpcol_15_130931,type,
    tptpcol_15_130931: $i > $o ).

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

tff(genlmt,type,
    genlmt: ( $i * $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_tptpcol_15_130931,type,
    c_tptpcol_15_130931: $i ).

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

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

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

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

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

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

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

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

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

tff(f_275,negated_conjecture,
    ~ ( mtvisible(c_patterndetectormt)
     => genls(c_tptpcol_16_130933,c_tptpcol_15_130931) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query25) ).

tff(f_41,axiom,
    genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',just4) ).

tff(c_108,plain,
    ~ genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
    inference(cnfTransformation,[status(thm)],[f_275]) ).

tff(c_8,plain,
    genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_111,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_108,c_8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : CSR025+1 : TPTP v9.0.0. Released v3.4.0.
% 0.11/0.13  % 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.13/0.34  % Computer : n029.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 : Mon Apr  7 16:34:49 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.46/1.72  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.46/1.73  
% 3.46/1.73  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------