TSTP Solution File: GRP700-10 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP700-10 : TPTP v8.1.2. Released v8.1.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 : n024.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:57 EDT 2023

% Result   : Unsatisfiable 5.64s 2.60s
% Output   : CNFRefutation 5.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   37 (  31 unt;   6 typ;   0 def)
%            Number of atoms       :   31 (  30 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    :    6 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    8 (   4   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   49 (;  49   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ tuple > rd > mult > ld > #nlpp > x0 > unit

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_42,axiom,
    ! [X1] : ( tuple(mult(X1,x0),mult(x0,X1)) != tuple(unit,unit) ),
    file(unknown,unknown) ).

tff(c_10,plain,
    ! [A_9] : ( mult(A_9,unit) = A_9 ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_132,plain,
    ! [A_27,B_28] : ( ld(A_27,mult(A_27,B_28)) = B_28 ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_155,plain,
    ! [A_9] : ( ld(A_9,A_9) = unit ),
    inference(superposition,[status(thm),theory(equality)],[c_10,c_132]) ).

tff(c_4,plain,
    ! [A_3,B_4] : ( ld(A_3,mult(A_3,B_4)) = B_4 ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_2,plain,
    ! [A_1,B_2] : ( mult(A_1,ld(A_1,B_2)) = B_2 ),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

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

tff(c_390,plain,
    ! [A_42,B_43,C_44] : ( mult(mult(A_42,mult(B_43,mult(B_43,C_44))),B_43) = mult(mult(A_42,B_43),mult(B_43,mult(C_44,B_43))) ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_469,plain,
    ! [B_43,C_44] : ( mult(mult(unit,B_43),mult(B_43,mult(C_44,B_43))) = mult(mult(B_43,mult(B_43,C_44)),B_43) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_390]) ).

tff(c_824,plain,
    ! [B_52,C_53] : ( mult(mult(B_52,mult(B_52,C_53)),B_52) = mult(B_52,mult(B_52,mult(C_53,B_52))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_469]) ).

tff(c_2700,plain,
    ! [A_82,B_83] : ( mult(A_82,mult(A_82,mult(ld(A_82,B_83),A_82))) = mult(mult(A_82,B_83),A_82) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_824]) ).

tff(c_8,plain,
    ! [A_7,B_8] : ( rd(mult(A_7,B_8),B_8) = A_7 ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_3272,plain,
    ! [A_89,B_90] : ( rd(mult(mult(A_89,B_90),A_89),mult(A_89,mult(ld(A_89,B_90),A_89))) = A_89 ),
    inference(superposition,[status(thm),theory(equality)],[c_2700,c_8]) ).

tff(c_3412,plain,
    ! [A_91] : ( rd(mult(A_91,A_91),mult(A_91,mult(ld(A_91,unit),A_91))) = A_91 ),
    inference(superposition,[status(thm),theory(equality)],[c_10,c_3272]) ).

tff(c_166,plain,
    ! [A_29,B_30] : ( mult(rd(A_29,B_30),B_30) = A_29 ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_172,plain,
    ! [A_29,B_30] : ( ld(rd(A_29,B_30),A_29) = B_30 ),
    inference(superposition,[status(thm),theory(equality)],[c_166,c_4]) ).

tff(c_3418,plain,
    ! [A_91] : ( mult(A_91,mult(ld(A_91,unit),A_91)) = ld(A_91,mult(A_91,A_91)) ),
    inference(superposition,[status(thm),theory(equality)],[c_3412,c_172]) ).

tff(c_3650,plain,
    ! [A_93] : ( mult(A_93,mult(ld(A_93,unit),A_93)) = A_93 ),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_3418]) ).

tff(c_866,plain,
    ! [B_52,C_53] : ( ld(mult(B_52,mult(B_52,C_53)),mult(B_52,mult(B_52,mult(C_53,B_52)))) = B_52 ),
    inference(superposition,[status(thm),theory(equality)],[c_824,c_4]) ).

tff(c_3690,plain,
    ! [A_93] : ( ld(mult(mult(ld(A_93,unit),A_93),mult(mult(ld(A_93,unit),A_93),A_93)),mult(mult(ld(A_93,unit),A_93),mult(mult(ld(A_93,unit),A_93),A_93))) = mult(ld(A_93,unit),A_93) ),
    inference(superposition,[status(thm),theory(equality)],[c_3650,c_866]) ).

tff(c_3814,plain,
    ! [A_94] : ( mult(ld(A_94,unit),A_94) = unit ),
    inference(demodulation,[status(thm),theory(equality)],[c_155,c_3690]) ).

tff(c_283,plain,
    ! [X1_36] : ( tuple(mult(X1_36,x0),mult(x0,X1_36)) != tuple(unit,unit) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_291,plain,
    ! [B_2] : ( tuple(mult(ld(x0,B_2),x0),B_2) != tuple(unit,unit) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_283]) ).

tff(c_3965,plain,
    $false,
    inference(superposition,[status(thm),theory(equality)],[c_3814,c_291]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : GRP700-10 : TPTP v8.1.2. Released v8.1.0.
% 0.08/0.15  % 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.15/0.36  % Computer : n024.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 22:14:30 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 5.64/2.60  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.64/2.60  
% 5.64/2.60  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.91/2.63  
% 5.91/2.63  Inference rules
% 5.91/2.63  ----------------------
% 5.91/2.63  #Ref     : 0
% 5.91/2.63  #Sup     : 1006
% 5.91/2.63  #Fact    : 0
% 5.91/2.63  #Define  : 0
% 5.91/2.63  #Split   : 0
% 5.91/2.63  #Chain   : 0
% 5.91/2.63  #Close   : 0
% 5.91/2.63  
% 5.91/2.63  Ordering : KBO
% 5.91/2.63  
% 5.91/2.63  Simplification rules
% 5.91/2.63  ----------------------
% 5.91/2.63  #Subsume      : 6
% 5.91/2.63  #Demod        : 1735
% 5.91/2.63  #Tautology    : 377
% 5.91/2.63  #SimpNegUnit  : 0
% 5.91/2.63  #BackRed      : 3
% 5.91/2.63  
% 5.91/2.63  #Partial instantiations: 0
% 5.91/2.63  #Strategies tried      : 1
% 5.91/2.63  
% 5.91/2.63  Timing (in seconds)
% 5.91/2.63  ----------------------
% 5.91/2.63  Preprocessing        : 0.44
% 5.91/2.63  Parsing              : 0.24
% 5.91/2.63  CNF conversion       : 0.02
% 5.91/2.63  Main loop            : 0.99
% 5.91/2.63  Inferencing          : 0.35
% 5.91/2.63  Reduction            : 0.42
% 5.91/2.63  Demodulation         : 0.36
% 5.91/2.64  BG Simplification    : 0.04
% 5.91/2.64  Subsumption          : 0.12
% 5.91/2.64  Abstraction          : 0.06
% 5.91/2.64  MUC search           : 0.00
% 5.91/2.64  Cooper               : 0.00
% 5.91/2.64  Total                : 1.48
% 5.91/2.64  Index Insertion      : 0.00
% 5.91/2.64  Index Deletion       : 0.00
% 5.91/2.64  Index Matching       : 0.00
% 5.91/2.64  BG Taut test         : 0.00
%------------------------------------------------------------------------------