↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : KLE061+1 : TPTP v9.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n018.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 : Wed Apr  9 07:04:42 PM UTC 2025

% Result   : Theorem 5.57s 2.44s
% Output   : CNFRefutation 5.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (  22 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (  21 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (  29   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > domain > zero > one > #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_1',type,
    '#skF_1': $i ).

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

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

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

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

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

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

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

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

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

tff(f_125,negated_conjecture,
    ~ ! [X0] : ( multiplication(domain(X0),domain(X0)) = domain(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

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

tff(c_299,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_319,plain,
    ! [X1_45] : ( domain(multiplication(one,X1_45)) = domain(domain(X1_45)) ),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_299]) ).

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

tff(c_154,plain,
    ! [B_36,A_37] : ( addition(B_36,A_37) = addition(A_37,B_36) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

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

tff(c_178,plain,
    ! [X0_26] : ( addition(one,domain(X0_26)) = one ),
    inference(superposition,[status(thm),theory(equality)],[c_154,c_32]) ).

tff(c_1444,plain,
    ! [A_71,C_72,B_73] : ( addition(multiplication(A_71,C_72),multiplication(B_73,C_72)) = multiplication(addition(A_71,B_73),C_72) ),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

tff(c_4220,plain,
    ! [B_106,A_107] : ( multiplication(addition(one,B_106),A_107) = addition(A_107,multiplication(B_106,A_107)) ),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_1444]) ).

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_4279,plain,
    ! [A_107] : ( multiplication(addition(one,domain(A_107)),A_107) = multiplication(domain(A_107),A_107) ),
    inference(superposition,[status(thm),theory(equality)],[c_4220,c_28]) ).

tff(c_4422,plain,
    ! [A_108] : ( multiplication(domain(A_108),A_108) = A_108 ),
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_178,c_4279]) ).

tff(c_4525,plain,
    ! [X1_45] : ( multiplication(domain(X1_45),domain(X1_45)) = domain(X1_45) ),
    inference(superposition,[status(thm),theory(equality)],[c_333,c_4422]) ).

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

tff(c_4908,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_4525,c_38]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : KLE061+1 : TPTP v9.0.0. Released v4.0.0.
% 0.04/0.13  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34  % Computer : n018.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 : Tue Apr  8 02:35:02 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 5.57/2.44  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.57/2.45  
% 5.57/2.45  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------