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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : KLE064+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 : n029.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:44:47 EDT 2023

% Result   : Theorem 111.51s 95.88s
% Output   : CNFRefutation 111.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   55 (  46 unt;   8 typ;   0 def)
%            Number of atoms       :   48 (  47 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    4 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   1  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   4   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   73 (;  73   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > domain > zero > one > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

tff('#skF_2',type,
    '#skF_2': $i ).

tff('#skF_1',type,
    '#skF_1': $i ).

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

tff(leq,type,
    leq: ( $i * $i ) > $o ).

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

tff(f_52,axiom,
    ! [A,B] : ( addition(A,B) = addition(B,A) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).

tff(f_65,axiom,
    ! [A] : ( multiplication(one,A) = A ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).

tff(f_63,axiom,
    ! [A] : ( multiplication(A,one) = A ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).

tff(f_117,axiom,
    ! [X0] : ( addition(domain(X0),one) = one ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain3) ).

tff(f_68,axiom,
    ! [A,B,C] : ( multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).

tff(f_70,axiom,
    ! [A,B,C] : ( multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).

tff(f_127,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( addition(X0,multiplication(domain(X1),X0)) = multiplication(domain(X1),X0) )
       <= ( addition(domain(X0),domain(X1)) = domain(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

tff(f_115,axiom,
    ! [X0,X1] : ( domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).

tff(f_113,axiom,
    ! [X0] : ( addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).

tff(f_54,axiom,
    ! [C,B,A] : ( addition(A,addition(B,C)) = addition(addition(A,B),C) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).

tff(c_2,plain,
    ! [B_2,A_1] : ( addition(B_2,A_1) = addition(A_1,B_2) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_14,plain,
    ! [A_12] : ( multiplication(one,A_12) = A_12 ),
    inference(cnfTransformation,[status(thm)],[f_65]) ).

tff(c_12,plain,
    ! [A_11] : ( multiplication(A_11,one) = A_11 ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_32,plain,
    ! [X0_26] : ( addition(domain(X0_26),one) = one ),
    inference(cnfTransformation,[status(thm)],[f_117]) ).

tff(c_1672,plain,
    ! [A_74,B_75,C_76] : ( addition(multiplication(A_74,B_75),multiplication(A_74,C_76)) = multiplication(A_74,addition(B_75,C_76)) ),
    inference(cnfTransformation,[status(thm)],[f_68]) ).

tff(c_11309,plain,
    ! [A_147,B_148] : ( multiplication(A_147,addition(B_148,one)) = addition(multiplication(A_147,B_148),A_147) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_1672]) ).

tff(c_11521,plain,
    ! [A_147,X0_26] : ( addition(multiplication(A_147,domain(X0_26)),A_147) = multiplication(A_147,one) ),
    inference(superposition,[status(thm),theory(equality)],[c_32,c_11309]) ).

tff(c_11571,plain,
    ! [A_147,X0_26] : ( addition(multiplication(A_147,domain(X0_26)),A_147) = A_147 ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_11521]) ).

tff(c_2425,plain,
    ! [A_85,C_86,B_87] : ( addition(multiplication(A_85,C_86),multiplication(B_87,C_86)) = multiplication(addition(A_85,B_87),C_86) ),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

tff(c_13611,plain,
    ! [A_163,A_164] : ( multiplication(addition(A_163,one),A_164) = addition(multiplication(A_163,A_164),A_164) ),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_2425]) ).

tff(c_13782,plain,
    ! [X0_26,A_164] : ( addition(multiplication(multiplication(one,domain(X0_26)),A_164),A_164) = multiplication(one,A_164) ),
    inference(superposition,[status(thm),theory(equality)],[c_11571,c_13611]) ).

tff(c_13906,plain,
    ! [A_164,X0_26] : ( addition(A_164,multiplication(domain(X0_26),A_164)) = A_164 ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_14,c_14,c_13782]) ).

tff(c_38,plain,
    addition('#skF_1',multiplication(domain('#skF_2'),'#skF_1')) != multiplication(domain('#skF_2'),'#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_127]) ).

tff(c_14235,plain,
    multiplication(domain('#skF_2'),'#skF_1') != '#skF_1',
    inference(demodulation,[status(thm),theory(equality)],[c_13906,c_38]) ).

tff(c_305,plain,
    ! [X0_44,X1_45] : ( domain(multiplication(X0_44,domain(X1_45))) = domain(multiplication(X0_44,X1_45)) ),
    inference(cnfTransformation,[status(thm)],[f_115]) ).

tff(c_325,plain,
    ! [X1_45] : ( domain(multiplication(one,X1_45)) = domain(domain(X1_45)) ),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_305]) ).

tff(c_339,plain,
    ! [X1_45] : ( domain(domain(X1_45)) = domain(X1_45) ),
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_325]) ).

tff(c_28,plain,
    ! [X0_23] : ( addition(X0_23,multiplication(domain(X0_23),X0_23)) = multiplication(domain(X0_23),X0_23) ),
    inference(cnfTransformation,[status(thm)],[f_113]) ).

tff(c_14520,plain,
    ! [X0_169] : ( multiplication(domain(X0_169),X0_169) = X0_169 ),
    inference(demodulation,[status(thm),theory(equality)],[c_13906,c_28]) ).

tff(c_14655,plain,
    ! [X1_45] : ( multiplication(domain(X1_45),domain(X1_45)) = domain(X1_45) ),
    inference(superposition,[status(thm),theory(equality)],[c_339,c_14520]) ).

tff(c_40,plain,
    addition(domain('#skF_1'),domain('#skF_2')) = domain('#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_127]) ).

tff(c_11577,plain,
    ! [A_149,X0_150] : ( addition(multiplication(A_149,domain(X0_150)),A_149) = A_149 ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_11521]) ).

tff(c_1715,plain,
    ! [A_11,B_75] : ( multiplication(A_11,addition(B_75,one)) = addition(multiplication(A_11,B_75),A_11) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_1672]) ).

tff(c_11584,plain,
    ! [A_11,X0_150] : ( addition(multiplication(A_11,multiplication(one,domain(X0_150))),A_11) = multiplication(A_11,one) ),
    inference(superposition,[status(thm),theory(equality)],[c_11577,c_1715]) ).

tff(c_11863,plain,
    ! [A_151,X0_152] : ( addition(A_151,multiplication(A_151,domain(X0_152))) = A_151 ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_12,c_14,c_11584]) ).

tff(c_841,plain,
    ! [A_56,B_57,C_58] : ( addition(addition(A_56,B_57),C_58) = addition(A_56,addition(B_57,C_58)) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_2826,plain,
    ! [A_91,B_92,C_93] : ( addition(addition(A_91,B_92),C_93) = addition(B_92,addition(A_91,C_93)) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_841]) ).

tff(c_3015,plain,
    ! [C_93] : ( addition(domain('#skF_2'),addition(domain('#skF_1'),C_93)) = addition(domain('#skF_2'),C_93) ),
    inference(superposition,[status(thm),theory(equality)],[c_40,c_2826]) ).

tff(c_11929,plain,
    ! [X0_152] : ( addition(domain('#skF_2'),multiplication(domain('#skF_1'),domain(X0_152))) = addition(domain('#skF_2'),domain('#skF_1')) ),
    inference(superposition,[status(thm),theory(equality)],[c_11863,c_3015]) ).

tff(c_84681,plain,
    ! [X0_388] : ( addition(domain('#skF_2'),multiplication(domain('#skF_1'),domain(X0_388))) = domain('#skF_2') ),
    inference(demodulation,[status(thm),theory(equality)],[c_40,c_2,c_11929]) ).

tff(c_84950,plain,
    addition(domain('#skF_2'),domain('#skF_1')) = domain('#skF_2'),
    inference(superposition,[status(thm),theory(equality)],[c_14655,c_84681]) ).

tff(c_18,plain,
    ! [A_16,C_18,B_17] : ( addition(multiplication(A_16,C_18),multiplication(B_17,C_18)) = multiplication(addition(A_16,B_17),C_18) ),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

tff(c_14563,plain,
    ! [A_16,X0_169] : ( multiplication(addition(A_16,domain(X0_169)),X0_169) = addition(multiplication(A_16,X0_169),X0_169) ),
    inference(superposition,[status(thm),theory(equality)],[c_14520,c_18]) ).

tff(c_315761,plain,
    ! [A_751,X0_752] : ( multiplication(addition(A_751,domain(X0_752)),X0_752) = addition(X0_752,multiplication(A_751,X0_752)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_14563]) ).

tff(c_316403,plain,
    addition('#skF_1',multiplication(domain('#skF_2'),'#skF_1')) = multiplication(domain('#skF_2'),'#skF_1'),
    inference(superposition,[status(thm),theory(equality)],[c_84950,c_315761]) ).

tff(c_316881,plain,
    multiplication(domain('#skF_2'),'#skF_1') = '#skF_1',
    inference(demodulation,[status(thm),theory(equality)],[c_13906,c_316403]) ).

tff(c_316883,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_14235,c_316881]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : KLE064+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.35  % Computer : n029.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 : Thu Aug  3 23:39:22 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 111.51/95.88  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 111.57/95.89  
% 111.57/95.89  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 111.57/95.92  
% 111.57/95.92  Inference rules
% 111.57/95.92  ----------------------
% 111.57/95.92  #Ref     : 0
% 111.57/95.92  #Sup     : 77449
% 111.57/95.92  #Fact    : 0
% 111.57/95.92  #Define  : 0
% 111.57/95.92  #Split   : 0
% 111.57/95.92  #Chain   : 0
% 111.57/95.92  #Close   : 0
% 111.57/95.92  
% 111.57/95.92  Ordering : KBO
% 111.57/95.92  
% 111.57/95.92  Simplification rules
% 111.57/95.92  ----------------------
% 111.57/95.92  #Subsume      : 7884
% 111.57/95.92  #Demod        : 153192
% 111.57/95.92  #Tautology    : 31780
% 111.57/95.92  #SimpNegUnit  : 1
% 111.57/95.92  #BackRed      : 15
% 111.57/95.92  
% 111.57/95.92  #Partial instantiations: 0
% 111.57/95.92  #Strategies tried      : 1
% 111.57/95.92  
% 111.57/95.92  Timing (in seconds)
% 111.57/95.92  ----------------------
% 111.57/95.93  Preprocessing        : 0.49
% 111.57/95.93  Parsing              : 0.27
% 111.57/95.93  CNF conversion       : 0.03
% 111.57/95.93  Main loop            : 94.39
% 111.57/95.93  Inferencing          : 5.43
% 111.57/95.93  Reduction            : 76.86
% 111.57/95.93  Demodulation         : 74.45
% 111.57/95.93  BG Simplification    : 0.76
% 111.57/95.93  Subsumption          : 9.56
% 111.57/95.93  Abstraction          : 1.83
% 111.57/95.93  MUC search           : 0.00
% 111.57/95.93  Cooper               : 0.00
% 111.57/95.93  Total                : 94.93
% 111.57/95.93  Index Insertion      : 0.00
% 111.57/95.93  Index Deletion       : 0.00
% 111.57/95.93  Index Matching       : 0.00
% 111.57/95.93  BG Taut test         : 0.00
%------------------------------------------------------------------------------