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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ALG173+1 : TPTP v8.1.2. Released v2.7.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 : n019.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:32:16 EDT 2023

% Result   : Theorem 95.70s 82.80s
% Output   : CNFRefutation 95.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   17 (   8 unt;   6 typ;   0 def)
%            Number of atoms       :   72 (  71 equ)
%            Maximal formula atoms :   50 (   6 avg)
%            Number of connectives :   99 (  38   ~;   4   |;  57   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   28 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    2 (   1   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ op > #nlpp > e4 > 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(op,type,
    op: ( $i * $i ) > $i ).

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

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

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

tff(f_1157,axiom,
    ( ( e0 = op(op(e3,op(e3,e3)),op(e3,op(e3,e3))) )
    & ( e1 = op(e3,op(e3,op(e3,e3))) )
    & ( e2 = op(e3,e3) )
    & ( e4 = op(e3,op(e3,e3)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).

tff(f_1150,axiom,
    ( ( e0 != e1 )
    & ( e0 != e2 )
    & ( e0 != e3 )
    & ( e0 != e4 )
    & ( e1 != e2 )
    & ( e1 != e3 )
    & ( e1 != e4 )
    & ( e2 != e3 )
    & ( e2 != e4 )
    & ( e3 != e4 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

tff(c_442,plain,
    op(e3,op(e3,e3)) = e3,
    inference(cnfTransformation,[status(thm)],[f_1283]) ).

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

tff(c_6729,plain,
    op(e3,e3) = e0,
    inference(demodulation,[status(thm),theory(equality)],[c_442,c_442,c_428]) ).

tff(c_6744,plain,
    op(e3,e0) = e3,
    inference(demodulation,[status(thm),theory(equality)],[c_6729,c_442]) ).

tff(c_426,plain,
    op(e3,op(e3,op(e3,e3))) = e1,
    inference(cnfTransformation,[status(thm)],[f_1157]) ).

tff(c_7983,plain,
    e1 = e0,
    inference(demodulation,[status(thm),theory(equality)],[c_6729,c_6744,c_6729,c_426]) ).

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

tff(c_11914,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_7983,c_420]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : ALG173+1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/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 : n019.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:19:16 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 95.70/82.80  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 95.70/82.80  
% 95.70/82.80  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 95.70/82.84  
% 95.70/82.85  Inference rules
% 95.70/82.85  ----------------------
% 95.70/82.85  #Ref     : 0
% 95.70/82.85  #Sup     : 0
% 95.70/82.85  #Fact    : 0
% 95.70/82.85  #Define  : 0
% 95.70/82.85  #Split   : 0
% 95.70/82.85  #Chain   : 0
% 95.70/82.85  #Close   : 0
% 95.70/82.85  
% 95.70/82.85  Ordering : KBO
% 95.70/82.85  
% 95.70/82.85  Simplification rules
% 95.70/82.85  ----------------------
% 95.70/82.85  #Subsume      : 3341
% 95.70/82.85  #Demod        : 12002
% 95.70/82.85  #Tautology    : 22
% 95.70/82.85  #SimpNegUnit  : 0
% 95.70/82.85  #BackRed      : 0
% 95.70/82.85  
% 95.70/82.85  #Partial instantiations: 0
% 95.70/82.85  #Strategies tried      : 1
% 95.70/82.85  
% 95.70/82.85  Timing (in seconds)
% 95.70/82.85  ----------------------
% 95.70/82.85  Preprocessing        : 1.19
% 95.70/82.85  Parsing              : 0.42
% 95.70/82.85  CNF conversion       : 0.09
% 95.70/82.85  Main loop            : 80.56
% 95.70/82.85  Inferencing          : 0.00
% 95.70/82.85  Reduction            : 12.06
% 95.70/82.85  Demodulation         : 9.95
% 95.70/82.85  BG Simplification    : 0.25
% 95.70/82.85  Subsumption          : 66.17
% 95.70/82.85  Abstraction          : 0.31
% 95.70/82.85  MUC search           : 0.00
% 95.70/82.85  Cooper               : 0.00
% 95.70/82.85  Total                : 81.82
% 95.70/82.85  Index Insertion      : 0.00
% 95.70/82.85  Index Deletion       : 0.00
% 95.70/82.85  Index Matching       : 0.00
% 95.70/82.85  BG Taut test         : 0.00
%------------------------------------------------------------------------------