↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : ALG017+1 : TPTP v9.0.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n003.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:23:58 PM UTC 2025

% Result   : Theorem 7.43s 2.87s
% Output   : CNFRefutation 7.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   26 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   96 (  95 equ)
%            Maximal formula atoms :   32 (   3 avg)
%            Number of connectives :   91 (  21   ~;  39   |;  31   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ op > #nlpp > inv > unit > e3 > e2 > e1 > e0

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(e1,type,
    e1: $i ).

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

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

tff(inv,type,
    inv: $i > $i ).

tff(op,type,
    op: ( $i * $i ) > $i ).

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

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

tff(f_597,axiom,
    ( ( e0 != e1 )
    & ( e0 != e2 )
    & ( e0 != e3 )
    & ( e1 != e2 )
    & ( e1 != e3 )
    & ( e2 != e3 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax10) ).

tff(f_600,axiom,
    ( ( e0 = op(e3,e3) )
    & ( e1 = op(e2,e3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax11) ).

tff(f_666,negated_conjecture,
    ~ ~ ( ( ( ( op(e0,e0) = e0 )
            & ( op(e1,e1) = e0 )
            & ( op(e2,e2) = e0 )
            & ( op(e3,e3) = e0 ) )
          | ( ( op(e0,e0) = e1 )
            & ( op(e1,e1) = e1 )
            & ( op(e2,e2) = e1 )
            & ( op(e3,e3) = e1 ) )
          | ( ( op(e0,e0) = e2 )
            & ( op(e1,e1) = e2 )
            & ( op(e2,e2) = e2 )
            & ( op(e3,e3) = e2 ) )
          | ( ( op(e0,e0) = e3 )
            & ( op(e1,e1) = e3 )
            & ( op(e2,e2) = e3 )
            & ( op(e3,e3) = e3 ) ) )
        & ~ ( ( ( op(e0,e0) = e0 )
              & ( op(e1,e1) = e0 )
              & ( op(e2,e2) = e0 )
              & ( op(e3,e3) = e0 ) )
            | ( ( op(e0,e0) = e1 )
              & ( op(e1,e1) = e1 )
              & ( op(e2,e2) = e1 )
              & ( op(e3,e3) = e1 ) )
            | ( ( op(e0,e0) = e2 )
              & ( op(e1,e1) = e2 )
              & ( op(e2,e2) = e2 )
              & ( op(e3,e3) = e2 ) )
            | ( ( op(e0,e0) = e3 )
              & ( op(e1,e1) = e3 )
              & ( op(e2,e2) = e3 )
              & ( op(e3,e3) = e3 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(c_360,plain,
    e3 != e0,
    inference(cnfTransformation,[status(thm)],[f_597]) ).

tff(c_362,plain,
    e2 != e0,
    inference(cnfTransformation,[status(thm)],[f_597]) ).

tff(c_364,plain,
    e1 != e0,
    inference(cnfTransformation,[status(thm)],[f_597]) ).

tff(c_368,plain,
    op(e3,e3) = e0,
    inference(cnfTransformation,[status(thm)],[f_600]) ).

tff(c_382,plain,
    ( ( op(e1,e1) = e0 )
    | ( op(e3,e3) = e1 )
    | ( op(e3,e3) = e2 )
    | ( op(e3,e3) = e3 ) ),
    inference(cnfTransformation,[status(thm)],[f_666]) ).

tff(c_1061,plain,
    ( ( op(e1,e1) = e0 )
    | ( e1 = e0 )
    | ( e2 = e0 )
    | ( e3 = e0 ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_368,c_368,c_368,c_382]) ).

tff(c_1072,plain,
    ( ( op(e1,e1) = e0 )
    | ( e2 = e0 )
    | ( e3 = e0 ) ),
    inference(negUnitSimplification,[status(thm)],[c_364,c_1061]) ).

tff(c_1119,plain,
    ( ( op(e1,e1) = e0 )
    | ( e3 = e0 ) ),
    inference(negUnitSimplification,[status(thm)],[c_362,c_1072]) ).

tff(c_1130,plain,
    op(e1,e1) = e0,
    inference(negUnitSimplification,[status(thm)],[c_360,c_1119]) ).

tff(c_380,plain,
    ( ( op(e2,e2) = e0 )
    | ( op(e3,e3) = e1 )
    | ( op(e3,e3) = e2 )
    | ( op(e3,e3) = e3 ) ),
    inference(cnfTransformation,[status(thm)],[f_666]) ).

tff(c_1062,plain,
    ( ( op(e2,e2) = e0 )
    | ( e1 = e0 )
    | ( e2 = e0 )
    | ( e3 = e0 ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_368,c_368,c_368,c_380]) ).

tff(c_1078,plain,
    ( ( op(e2,e2) = e0 )
    | ( e2 = e0 )
    | ( e3 = e0 ) ),
    inference(negUnitSimplification,[status(thm)],[c_364,c_1062]) ).

tff(c_1120,plain,
    ( ( op(e2,e2) = e0 )
    | ( e3 = e0 ) ),
    inference(negUnitSimplification,[status(thm)],[c_362,c_1078]) ).

tff(c_1131,plain,
    op(e2,e2) = e0,
    inference(negUnitSimplification,[status(thm)],[c_360,c_1120]) ).

tff(c_384,plain,
    ( ( op(e0,e0) = e0 )
    | ( op(e3,e3) = e1 )
    | ( op(e3,e3) = e2 )
    | ( op(e3,e3) = e3 ) ),
    inference(cnfTransformation,[status(thm)],[f_666]) ).

tff(c_1060,plain,
    ( ( op(e0,e0) = e0 )
    | ( e1 = e0 )
    | ( e2 = e0 )
    | ( e3 = e0 ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_368,c_368,c_368,c_384]) ).

tff(c_1069,plain,
    ( ( op(e0,e0) = e0 )
    | ( e2 = e0 )
    | ( e3 = e0 ) ),
    inference(negUnitSimplification,[status(thm)],[c_364,c_1060]) ).

tff(c_1117,plain,
    ( ( op(e0,e0) = e0 )
    | ( e3 = e0 ) ),
    inference(negUnitSimplification,[status(thm)],[c_362,c_1069]) ).

tff(c_1129,plain,
    op(e0,e0) = e0,
    inference(negUnitSimplification,[status(thm)],[c_360,c_1117]) ).

tff(c_376,plain,
    ( ( op(e3,e3) != e0 )
    | ( op(e2,e2) != e0 )
    | ( op(e1,e1) != e0 )
    | ( op(e0,e0) != e0 ) ),
    inference(cnfTransformation,[status(thm)],[f_666]) ).

tff(c_1065,plain,
    ( ( op(e2,e2) != e0 )
    | ( op(e1,e1) != e0 )
    | ( op(e0,e0) != e0 ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_368,c_376]) ).

tff(c_1135,plain,
    ( ( op(e2,e2) != e0 )
    | ( op(e1,e1) != e0 ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_1129,c_1065]) ).

tff(c_1144,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1130,c_1131,c_1135]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : ALG017+1 : TPTP v9.0.0. Released v2.7.0.
% 0.13/0.14  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35  % Computer : n003.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sun Apr  6 06:54:18 EDT 2025
% 0.22/0.36  % CPUTime  : 
% 7.43/2.87  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.43/2.88  
% 7.43/2.88  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------