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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : KLE114+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 : n013.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:52 EDT 2023

% Result   : Theorem 6.31s 2.55s
% Output   : CNFRefutation 6.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   58 (  42 unt;  16 typ;   0 def)
%            Number of atoms       :   42 (  41 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   21 (  13   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   3 con; 0-2 aty)
%            Number of variables   :   31 (;  31   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ leq > multiplication > forward_diamond > forward_box > domain_difference > backward_diamond > backward_box > addition > #nlpp > domain > codomain > coantidomain > c > antidomain > zero > one > #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(multiplication,type,
    multiplication: ( $i * $i ) > $i ).

tff(addition,type,
    addition: ( $i * $i ) > $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_57,axiom,
    ! [A] : ( addition(A,zero) = A ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).

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

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

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

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

tff(f_162,axiom,
    ! [X0] : ( c(X0) = antidomain(domain(X0)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+6.ax',complement) ).

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

tff(f_166,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_170,axiom,
    ! [X0,X1] : ( forward_box(X0,X1) = c(forward_diamond(X0,c(X1))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+6.ax',forward_box) ).

tff(f_177,negated_conjecture,
    ~ ! [X0] : ( forward_box(X0,one) = one ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

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

tff(c_159,plain,
    ! [X0_50] : ( multiplication(antidomain(X0_50),X0_50) = zero ),
    inference(cnfTransformation,[status(thm)],[f_112]) ).

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

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

tff(c_203,plain,
    ! [X0_52] : ( antidomain(antidomain(X0_52)) = domain(X0_52) ),
    inference(cnfTransformation,[status(thm)],[f_118]) ).

tff(c_224,plain,
    domain(one) = antidomain(zero),
    inference(superposition,[status(thm),theory(equality)],[c_165,c_203]) ).

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

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

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

tff(c_559,plain,
    addition(domain(one),zero) = one,
    inference(superposition,[status(thm),theory(equality)],[c_165,c_519]) ).

tff(c_566,plain,
    antidomain(zero) = one,
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_224,c_559]) ).

tff(c_568,plain,
    domain(one) = one,
    inference(demodulation,[status(thm),theory(equality)],[c_566,c_224]) ).

tff(c_44,plain,
    ! [X0_33] : ( antidomain(domain(X0_33)) = c(X0_33) ),
    inference(cnfTransformation,[status(thm)],[f_162]) ).

tff(c_595,plain,
    c(one) = antidomain(one),
    inference(superposition,[status(thm),theory(equality)],[c_568,c_44]) ).

tff(c_599,plain,
    c(one) = zero,
    inference(demodulation,[status(thm),theory(equality)],[c_165,c_595]) ).

tff(c_215,plain,
    ! [X0_27] : ( domain(antidomain(X0_27)) = antidomain(domain(X0_27)) ),
    inference(superposition,[status(thm),theory(equality)],[c_34,c_203]) ).

tff(c_293,plain,
    ! [X0_55] : ( domain(antidomain(X0_55)) = c(X0_55) ),
    inference(demodulation,[status(thm),theory(equality)],[c_44,c_215]) ).

tff(c_311,plain,
    domain(zero) = c(one),
    inference(superposition,[status(thm),theory(equality)],[c_165,c_293]) ).

tff(c_414,plain,
    antidomain(c(one)) = c(zero),
    inference(superposition,[status(thm),theory(equality)],[c_311,c_44]) ).

tff(c_620,plain,
    c(zero) = antidomain(zero),
    inference(demodulation,[status(thm),theory(equality)],[c_599,c_414]) ).

tff(c_621,plain,
    c(zero) = one,
    inference(demodulation,[status(thm),theory(equality)],[c_566,c_620]) ).

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

tff(c_586,plain,
    domain(zero) = zero,
    inference(demodulation,[status(thm),theory(equality)],[c_165,c_579]) ).

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

tff(c_962,plain,
    ! [X0_84,X1_85] : ( domain(multiplication(X0_84,domain(X1_85))) = forward_diamond(X0_84,X1_85) ),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_989,plain,
    ! [X0_84] : ( domain(multiplication(X0_84,zero)) = forward_diamond(X0_84,zero) ),
    inference(superposition,[status(thm),theory(equality)],[c_586,c_962]) ).

tff(c_1010,plain,
    ! [X0_84] : ( forward_diamond(X0_84,zero) = zero ),
    inference(demodulation,[status(thm),theory(equality)],[c_586,c_20,c_989]) ).

tff(c_800,plain,
    ! [X0_75,X1_76] : ( c(forward_diamond(X0_75,c(X1_76))) = forward_box(X0_75,X1_76) ),
    inference(cnfTransformation,[status(thm)],[f_170]) ).

tff(c_818,plain,
    ! [X0_75] : ( c(forward_diamond(X0_75,zero)) = forward_box(X0_75,one) ),
    inference(superposition,[status(thm),theory(equality)],[c_599,c_800]) ).

tff(c_5438,plain,
    ! [X0_75] : ( forward_box(X0_75,one) = one ),
    inference(demodulation,[status(thm),theory(equality)],[c_621,c_1010,c_818]) ).

tff(c_56,plain,
    forward_box('#skF_1',one) != one,
    inference(cnfTransformation,[status(thm)],[f_177]) ).

tff(c_5442,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_5438,c_56]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : KLE114+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/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.16/0.36  % Computer : n013.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 300
% 0.16/0.36  % DateTime : Thu Aug  3 23:19:32 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 6.31/2.55  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.44/2.55  
% 6.44/2.55  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.44/2.58  
% 6.44/2.58  Inference rules
% 6.44/2.58  ----------------------
% 6.44/2.58  #Ref     : 0
% 6.44/2.58  #Sup     : 1411
% 6.44/2.58  #Fact    : 0
% 6.44/2.58  #Define  : 0
% 6.44/2.58  #Split   : 0
% 6.44/2.58  #Chain   : 0
% 6.44/2.58  #Close   : 0
% 6.44/2.58  
% 6.44/2.58  Ordering : KBO
% 6.44/2.58  
% 6.44/2.58  Simplification rules
% 6.44/2.58  ----------------------
% 6.44/2.58  #Subsume      : 0
% 6.44/2.58  #Demod        : 1355
% 6.44/2.58  #Tautology    : 771
% 6.44/2.58  #SimpNegUnit  : 0
% 6.44/2.58  #BackRed      : 12
% 6.44/2.58  
% 6.44/2.58  #Partial instantiations: 0
% 6.44/2.58  #Strategies tried      : 1
% 6.44/2.58  
% 6.44/2.58  Timing (in seconds)
% 6.44/2.58  ----------------------
% 6.44/2.59  Preprocessing        : 0.51
% 6.44/2.59  Parsing              : 0.28
% 6.44/2.59  CNF conversion       : 0.03
% 6.44/2.59  Main loop            : 1.00
% 6.44/2.59  Inferencing          : 0.31
% 6.44/2.59  Reduction            : 0.43
% 6.44/2.59  Demodulation         : 0.34
% 6.44/2.59  BG Simplification    : 0.04
% 6.44/2.59  Subsumption          : 0.16
% 6.44/2.59  Abstraction          : 0.04
% 6.44/2.59  MUC search           : 0.00
% 6.44/2.59  Cooper               : 0.00
% 6.44/2.59  Total                : 1.57
% 6.44/2.59  Index Insertion      : 0.00
% 6.44/2.59  Index Deletion       : 0.00
% 6.44/2.59  Index Matching       : 0.00
% 6.44/2.59  BG Taut test         : 0.00
%------------------------------------------------------------------------------