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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : KLE133+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 : n005.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:54 EDT 2023

% Result   : Theorem 6.30s 2.51s
% Output   : CNFRefutation 6.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   31
% Syntax   : Number of formulae    :   78 (  58 unt;  19 typ;   0 def)
%            Number of atoms       :   61 (  60 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :    5 (   3   ~;   0   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   23 (  15   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;   4 con; 0-2 aty)
%            Number of variables   :   49 (;  49   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ leq > multiplication > forward_diamond > forward_box > domain_difference > backward_diamond > backward_box > addition > #nlpp > star > domain > divergence > codomain > coantidomain > c > antidomain > zero > one > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

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

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

tff(domain,type,
    domain: $i > $i ).

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

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

tff(antidomain,type,
    antidomain: $i > $i ).

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

tff(c,type,
    c: $i > $i ).

tff(star,type,
    star: $i > $i ).

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

tff(divergence,type,
    divergence: $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(backward_diamond,type,
    backward_diamond: ( $i * $i ) > $i ).

tff(codomain,type,
    codomain: $i > $i ).

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

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

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

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

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

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

tff(f_119,axiom,
    ! [X0] : ( domain(X0) = antidomain(antidomain(X0)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain4) ).

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

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

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

tff(f_165,axiom,
    ! [X0,X1] : ( domain_difference(X0,X1) = multiplication(domain(X0),antidomain(X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+6.ax',domain_difference) ).

tff(f_218,negated_conjecture,
    ~ ! [X0] :
        ( ( ! [X1] : ( addition(domain(X1),forward_diamond(star(X0),domain_difference(domain(X1),forward_diamond(X0,domain(X1))))) = forward_diamond(star(X0),domain_difference(domain(X1),forward_diamond(X0,domain(X1)))) )
          & ! [X2] : ( forward_diamond(X0,forward_diamond(X0,domain(X2))) = forward_diamond(X0,domain(X2)) ) )
       => ! [X3] : ( addition(forward_diamond(X0,domain(X3)),forward_diamond(star(X0),domain_difference(domain(X3),forward_diamond(X0,domain(X3))))) = forward_diamond(star(X0),domain_difference(domain(X3),forward_diamond(X0,domain(X3)))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

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

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

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

tff(c_208,plain,
    ! [X0_61] : ( multiplication(antidomain(X0_61),X0_61) = zero ),
    inference(cnfTransformation,[status(thm)],[f_113]) ).

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

tff(c_214,plain,
    antidomain(one) = zero,
    inference(superposition,[status(thm),theory(equality)],[c_208,c_12]) ).

tff(c_6,plain,
    ! [A_6] : ( addition(A_6,zero) = A_6 ),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_265,plain,
    ! [X0_63] : ( antidomain(antidomain(X0_63)) = domain(X0_63) ),
    inference(cnfTransformation,[status(thm)],[f_119]) ).

tff(c_283,plain,
    domain(one) = antidomain(zero),
    inference(superposition,[status(thm),theory(equality)],[c_214,c_265]) ).

tff(c_34,plain,
    ! [X0_27] : ( antidomain(antidomain(X0_27)) = domain(X0_27) ),
    inference(cnfTransformation,[status(thm)],[f_119]) ).

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

tff(c_544,plain,
    ! [X0_70] : ( addition(domain(X0_70),antidomain(X0_70)) = one ),
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_32]) ).

tff(c_581,plain,
    addition(domain(one),zero) = one,
    inference(superposition,[status(thm),theory(equality)],[c_214,c_544]) ).

tff(c_585,plain,
    antidomain(zero) = one,
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_283,c_581]) ).

tff(c_595,plain,
    domain(zero) = antidomain(one),
    inference(superposition,[status(thm),theory(equality)],[c_585,c_34]) ).

tff(c_602,plain,
    domain(zero) = zero,
    inference(demodulation,[status(thm),theory(equality)],[c_214,c_595]) ).

tff(c_20,plain,
    ! [A_19] : ( multiplication(A_19,zero) = zero ),
    inference(cnfTransformation,[status(thm)],[f_75]) ).

tff(c_1719,plain,
    ! [X0_108,X1_109] : ( domain(multiplication(X0_108,domain(X1_109))) = forward_diamond(X0_108,X1_109) ),
    inference(cnfTransformation,[status(thm)],[f_167]) ).

tff(c_1782,plain,
    ! [X0_108] : ( domain(multiplication(X0_108,zero)) = forward_diamond(X0_108,zero) ),
    inference(superposition,[status(thm),theory(equality)],[c_602,c_1719]) ).

tff(c_1805,plain,
    ! [X0_108] : ( forward_diamond(X0_108,zero) = zero ),
    inference(demodulation,[status(thm),theory(equality)],[c_602,c_20,c_1782]) ).

tff(c_1489,plain,
    ! [X0_100,X1_101] : ( multiplication(domain(X0_100),antidomain(X1_101)) = domain_difference(X0_100,X1_101) ),
    inference(cnfTransformation,[status(thm)],[f_165]) ).

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

tff(c_274,plain,
    ! [X0_63] : ( multiplication(domain(X0_63),antidomain(X0_63)) = zero ),
    inference(superposition,[status(thm),theory(equality)],[c_265,c_28]) ).

tff(c_1496,plain,
    ! [X1_101] : ( domain_difference(X1_101,X1_101) = zero ),
    inference(superposition,[status(thm),theory(equality)],[c_1489,c_274]) ).

tff(c_587,plain,
    domain(one) = one,
    inference(demodulation,[status(thm),theory(equality)],[c_585,c_283]) ).

tff(c_1785,plain,
    ! [X0_108] : ( domain(multiplication(X0_108,one)) = forward_diamond(X0_108,one) ),
    inference(superposition,[status(thm),theory(equality)],[c_587,c_1719]) ).

tff(c_1806,plain,
    ! [X0_108] : ( forward_diamond(X0_108,one) = domain(X0_108) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_1785]) ).

tff(c_62,plain,
    ! [X2_52] : ( forward_diamond('#skF_1',forward_diamond('#skF_1',domain(X2_52))) = forward_diamond('#skF_1',domain(X2_52)) ),
    inference(cnfTransformation,[status(thm)],[f_218]) ).

tff(c_623,plain,
    forward_diamond('#skF_1',forward_diamond('#skF_1',one)) = forward_diamond('#skF_1',domain(one)),
    inference(superposition,[status(thm),theory(equality)],[c_587,c_62]) ).

tff(c_631,plain,
    forward_diamond('#skF_1',forward_diamond('#skF_1',one)) = forward_diamond('#skF_1',one),
    inference(demodulation,[status(thm),theory(equality)],[c_587,c_623]) ).

tff(c_1977,plain,
    forward_diamond('#skF_1',domain('#skF_1')) = domain('#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_1806,c_1806,c_631]) ).

tff(c_64,plain,
    ! [X1_51] : ( addition(domain(X1_51),forward_diamond(star('#skF_1'),domain_difference(domain(X1_51),forward_diamond('#skF_1',domain(X1_51))))) = forward_diamond(star('#skF_1'),domain_difference(domain(X1_51),forward_diamond('#skF_1',domain(X1_51)))) ),
    inference(cnfTransformation,[status(thm)],[f_218]) ).

tff(c_2317,plain,
    addition(domain('#skF_1'),forward_diamond(star('#skF_1'),domain_difference(domain('#skF_1'),domain('#skF_1')))) = forward_diamond(star('#skF_1'),domain_difference(domain('#skF_1'),forward_diamond('#skF_1',domain('#skF_1')))),
    inference(superposition,[status(thm),theory(equality)],[c_1977,c_64]) ).

tff(c_2324,plain,
    domain('#skF_1') = zero,
    inference(demodulation,[status(thm),theory(equality)],[c_1805,c_1496,c_1977,c_6,c_1805,c_1496,c_2317]) ).

tff(c_67,plain,
    ! [X0_26] : ( addition(domain(X0_26),antidomain(X0_26)) = one ),
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_32]) ).

tff(c_2353,plain,
    addition(zero,antidomain('#skF_1')) = one,
    inference(superposition,[status(thm),theory(equality)],[c_2324,c_67]) ).

tff(c_383,plain,
    ! [B_66,A_67] : ( addition(B_66,A_67) = addition(A_67,B_66) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_399,plain,
    ! [A_67] : ( addition(zero,A_67) = A_67 ),
    inference(superposition,[status(thm),theory(equality)],[c_383,c_6]) ).

tff(c_2693,plain,
    antidomain('#skF_1') = one,
    inference(superposition,[status(thm),theory(equality)],[c_2353,c_399]) ).

tff(c_2726,plain,
    multiplication(one,'#skF_1') = zero,
    inference(superposition,[status(thm),theory(equality)],[c_2693,c_28]) ).

tff(c_2736,plain,
    zero = '#skF_1',
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_2726]) ).

tff(c_2851,plain,
    ! [A_67] : ( addition('#skF_1',A_67) = A_67 ),
    inference(demodulation,[status(thm),theory(equality)],[c_2736,c_399]) ).

tff(c_22,plain,
    ! [A_20] : ( multiplication(zero,A_20) = zero ),
    inference(cnfTransformation,[status(thm)],[f_77]) ).

tff(c_1797,plain,
    ! [X1_109] : ( forward_diamond(zero,X1_109) = domain(zero) ),
    inference(superposition,[status(thm),theory(equality)],[c_22,c_1719]) ).

tff(c_1808,plain,
    ! [X1_109] : ( forward_diamond(zero,X1_109) = zero ),
    inference(demodulation,[status(thm),theory(equality)],[c_602,c_1797]) ).

tff(c_2834,plain,
    ! [X1_109] : ( forward_diamond('#skF_1',X1_109) = '#skF_1' ),
    inference(demodulation,[status(thm),theory(equality)],[c_2736,c_2736,c_1808]) ).

tff(c_60,plain,
    addition(forward_diamond('#skF_1',domain('#skF_2')),forward_diamond(star('#skF_1'),domain_difference(domain('#skF_2'),forward_diamond('#skF_1',domain('#skF_2'))))) != forward_diamond(star('#skF_1'),domain_difference(domain('#skF_2'),forward_diamond('#skF_1',domain('#skF_2')))),
    inference(cnfTransformation,[status(thm)],[f_218]) ).

tff(c_3172,plain,
    addition('#skF_1',forward_diamond(star('#skF_1'),domain_difference(domain('#skF_2'),'#skF_1'))) != forward_diamond(star('#skF_1'),domain_difference(domain('#skF_2'),'#skF_1')),
    inference(demodulation,[status(thm),theory(equality)],[c_2834,c_2834,c_2834,c_60]) ).

tff(c_3518,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_2851,c_3172]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : KLE133+1 : TPTP v8.1.2. Released v4.0.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.36  % Computer : n005.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 23:20:41 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 6.30/2.51  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.30/2.52  
% 6.30/2.52  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.30/2.56  
% 6.30/2.56  Inference rules
% 6.30/2.56  ----------------------
% 6.30/2.56  #Ref     : 0
% 6.30/2.56  #Sup     : 895
% 6.30/2.56  #Fact    : 0
% 6.30/2.56  #Define  : 0
% 6.30/2.56  #Split   : 0
% 6.30/2.56  #Chain   : 0
% 6.30/2.56  #Close   : 0
% 6.30/2.56  
% 6.30/2.56  Ordering : KBO
% 6.30/2.56  
% 6.30/2.56  Simplification rules
% 6.30/2.56  ----------------------
% 6.30/2.56  #Subsume      : 0
% 6.30/2.56  #Demod        : 1040
% 6.30/2.56  #Tautology    : 578
% 6.30/2.56  #SimpNegUnit  : 0
% 6.30/2.56  #BackRed      : 52
% 6.30/2.56  
% 6.30/2.56  #Partial instantiations: 0
% 6.30/2.56  #Strategies tried      : 1
% 6.30/2.56  
% 6.30/2.56  Timing (in seconds)
% 6.30/2.56  ----------------------
% 6.30/2.56  Preprocessing        : 0.54
% 6.30/2.56  Parsing              : 0.29
% 6.30/2.56  CNF conversion       : 0.03
% 6.30/2.56  Main loop            : 0.93
% 6.30/2.56  Inferencing          : 0.27
% 6.30/2.56  Reduction            : 0.43
% 6.30/2.56  Demodulation         : 0.37
% 6.30/2.56  BG Simplification    : 0.04
% 6.30/2.56  Subsumption          : 0.13
% 6.30/2.56  Abstraction          : 0.03
% 6.30/2.56  MUC search           : 0.00
% 6.30/2.56  Cooper               : 0.00
% 6.30/2.56  Total                : 1.53
% 6.30/2.56  Index Insertion      : 0.00
% 6.30/2.56  Index Deletion       : 0.00
% 6.30/2.56  Index Matching       : 0.00
% 6.30/2.56  BG Taut test         : 0.00
%------------------------------------------------------------------------------