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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ALG199+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 : n031.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:20 EDT 2023

% Result   : Theorem 5.26s 2.17s
% Output   : CNFRefutation 5.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   18 (   8 unt;   8 typ;   0 def)
%            Number of atoms       :   36 (  35 equ)
%            Maximal formula atoms :   21 (   3 avg)
%            Number of connectives :   49 (  23   ~;  18   |;   8   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   4 avg)
%            Maximal term depth    :    2 (   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    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (;   0   !;   0   ?;   0   :)

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

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

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

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

tff(c_1052,plain,
    op(e0,e0) != e0,
    inference(cnfTransformation,[status(thm)],[f_3189]) ).

tff(c_1050,plain,
    op(e1,e1) != e1,
    inference(cnfTransformation,[status(thm)],[f_3189]) ).

tff(c_1048,plain,
    op(e2,e2) != e2,
    inference(cnfTransformation,[status(thm)],[f_3189]) ).

tff(c_1046,plain,
    op(e3,e3) != e3,
    inference(cnfTransformation,[status(thm)],[f_3189]) ).

tff(c_1044,plain,
    op(e4,e4) != e4,
    inference(cnfTransformation,[status(thm)],[f_3189]) ).

tff(c_1042,plain,
    op(e5,e5) != e5,
    inference(cnfTransformation,[status(thm)],[f_3189]) ).

tff(c_1040,plain,
    op(e6,e6) != e6,
    inference(cnfTransformation,[status(thm)],[f_3189]) ).

tff(c_1038,plain,
    ( ( op(e6,e6) = e6 )
    | ( op(e5,e5) = e5 )
    | ( op(e4,e4) = e4 )
    | ( op(e3,e3) = e3 )
    | ( op(e2,e2) = e2 )
    | ( op(e1,e1) = e1 )
    | ( op(e0,e0) = e0 ) ),
    inference(cnfTransformation,[status(thm)],[f_3189]) ).

tff(c_1053,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_1052,c_1050,c_1048,c_1046,c_1044,c_1042,c_1040,c_1038]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : ALG199+1 : TPTP v8.1.2. Released v2.7.0.
% 0.12/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 : n031.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:39:14 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 5.26/2.17  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.26/2.17  
% 5.26/2.17  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.58/2.19  
% 5.58/2.19  Inference rules
% 5.58/2.19  ----------------------
% 5.58/2.19  #Ref     : 0
% 5.58/2.19  #Sup     : 0
% 5.58/2.19  #Fact    : 0
% 5.58/2.19  #Define  : 0
% 5.58/2.19  #Split   : 0
% 5.58/2.19  #Chain   : 0
% 5.58/2.19  #Close   : 0
% 5.58/2.19  
% 5.58/2.19  Ordering : KBO
% 5.58/2.19  
% 5.58/2.19  Simplification rules
% 5.58/2.19  ----------------------
% 5.58/2.19  #Subsume      : 525
% 5.58/2.19  #Demod        : 0
% 5.58/2.19  #Tautology    : 0
% 5.58/2.19  #SimpNegUnit  : 1
% 5.58/2.19  #BackRed      : 0
% 5.58/2.19  
% 5.58/2.19  #Partial instantiations: 0
% 5.58/2.19  #Strategies tried      : 1
% 5.58/2.19  
% 5.58/2.19  Timing (in seconds)
% 5.58/2.19  ----------------------
% 5.58/2.19  Preprocessing        : 1.07
% 5.58/2.19  Parsing              : 0.60
% 5.58/2.20  CNF conversion       : 0.06
% 5.58/2.20  Main loop            : 0.08
% 5.58/2.20  Inferencing          : 0.00
% 5.58/2.20  Reduction            : 0.03
% 5.58/2.20  Demodulation         : 0.01
% 5.58/2.20  BG Simplification    : 0.08
% 5.58/2.20  Subsumption          : 0.04
% 5.58/2.20  Abstraction          : 0.02
% 5.58/2.20  MUC search           : 0.00
% 5.58/2.20  Cooper               : 0.00
% 5.58/2.20  Total                : 1.19
% 5.58/2.20  Index Insertion      : 0.00
% 5.58/2.20  Index Deletion       : 0.00
% 5.58/2.20  Index Matching       : 0.00
% 5.58/2.20  BG Taut test         : 0.00
%------------------------------------------------------------------------------