TSTP Solution File: GRP709-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP709-1 : TPTP v8.1.2. Released v4.0.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 : n006.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:41:59 EDT 2023

% Result   : Unsatisfiable 3.64s 2.18s
% Output   : CNFRefutation 4.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   23 (  16 unt;   7 typ;   0 def)
%            Number of atoms       :   16 (  15 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   23 (;  23   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > unit > op_c > b > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(ld,type,
    ld: ( $i * $i ) > $i ).

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

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

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

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

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

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

tff(f_41,axiom,
    ! [A,B] : ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) ),
    file(unknown,unknown) ).

tff(f_39,axiom,
    ! [A] : ( mult(op_c,A) = mult(A,op_c) ),
    file(unknown,unknown) ).

tff(f_37,axiom,
    ! [A,B,C] : ( mult(A,mult(B,mult(A,C))) = mult(mult(A,mult(B,A)),C) ),
    file(unknown,unknown) ).

tff(f_35,axiom,
    ! [A] : ( mult(unit,A) = A ),
    file(unknown,unknown) ).

tff(f_43,axiom,
    mult(mult(op_c,op_c),mult(a,b)) != mult(mult(mult(op_c,op_c),a),b),
    file(unknown,unknown) ).

tff(c_324,plain,
    ! [A_35,B_36] : ( mult(mult(A_35,B_36),op_c) = mult(A_35,mult(B_36,op_c)) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_16,plain,
    ! [A_14] : ( mult(op_c,A_14) = mult(A_14,op_c) ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_333,plain,
    ! [A_35,B_36] : ( mult(op_c,mult(A_35,B_36)) = mult(A_35,mult(B_36,op_c)) ),
    inference(superposition,[status(thm),theory(equality)],[c_324,c_16]) ).

tff(c_14,plain,
    ! [A_11,B_12,C_13] : ( mult(mult(A_11,mult(B_12,A_11)),C_13) = mult(A_11,mult(B_12,mult(A_11,C_13))) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_12,plain,
    ! [A_10] : ( mult(unit,A_10) = A_10 ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_513,plain,
    ! [A_41,B_42,C_43] : ( mult(mult(A_41,mult(B_42,A_41)),C_43) = mult(A_41,mult(B_42,mult(A_41,C_43))) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_602,plain,
    ! [A_10,C_43] : ( mult(A_10,mult(unit,mult(A_10,C_43))) = mult(mult(A_10,A_10),C_43) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_513]) ).

tff(c_619,plain,
    ! [A_10,C_43] : ( mult(mult(A_10,A_10),C_43) = mult(A_10,mult(A_10,C_43)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_602]) ).

tff(c_20,plain,
    mult(mult(mult(op_c,op_c),a),b) != mult(mult(op_c,op_c),mult(a,b)),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_1121,plain,
    mult(mult(op_c,mult(op_c,a)),b) != mult(op_c,mult(op_c,mult(a,b))),
    inference(demodulation,[status(thm),theory(equality)],[c_619,c_619,c_20]) ).

tff(c_1124,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_333,c_16,c_14,c_16,c_1121]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP709-1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/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 : n006.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 : Thu Aug  3 22:07:58 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 3.64/2.18  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.03/2.19  
% 4.03/2.19  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.03/2.22  
% 4.03/2.22  Inference rules
% 4.03/2.22  ----------------------
% 4.03/2.22  #Ref     : 0
% 4.03/2.22  #Sup     : 266
% 4.03/2.22  #Fact    : 0
% 4.03/2.22  #Define  : 0
% 4.03/2.22  #Split   : 0
% 4.03/2.22  #Chain   : 0
% 4.03/2.22  #Close   : 0
% 4.03/2.22  
% 4.03/2.22  Ordering : KBO
% 4.03/2.22  
% 4.03/2.22  Simplification rules
% 4.03/2.22  ----------------------
% 4.03/2.22  #Subsume      : 15
% 4.03/2.22  #Demod        : 127
% 4.03/2.22  #Tautology    : 162
% 4.03/2.22  #SimpNegUnit  : 0
% 4.03/2.22  #BackRed      : 2
% 4.03/2.22  
% 4.03/2.22  #Partial instantiations: 0
% 4.03/2.22  #Strategies tried      : 1
% 4.03/2.22  
% 4.03/2.22  Timing (in seconds)
% 4.03/2.22  ----------------------
% 4.03/2.22  Preprocessing        : 0.44
% 4.03/2.22  Parsing              : 0.24
% 4.03/2.22  CNF conversion       : 0.02
% 4.03/2.22  Main loop            : 0.62
% 4.03/2.22  Inferencing          : 0.26
% 4.03/2.22  Reduction            : 0.20
% 4.03/2.22  Demodulation         : 0.16
% 4.03/2.22  BG Simplification    : 0.03
% 4.03/2.22  Subsumption          : 0.10
% 4.03/2.22  Abstraction          : 0.03
% 4.03/2.22  MUC search           : 0.00
% 4.03/2.22  Cooper               : 0.00
% 4.03/2.22  Total                : 1.10
% 4.03/2.23  Index Insertion      : 0.00
% 4.03/2.23  Index Deletion       : 0.00
% 4.03/2.23  Index Matching       : 0.00
% 4.03/2.23  BG Taut test         : 0.00
%------------------------------------------------------------------------------