↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : KLE058+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/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 : n026.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 3.50s 1.85s
% Output   : CNFRefutation 3.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   14 (  13 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  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   11 (  11   !;   0   ?;   0   :)

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

%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(one,type,
    one: $i ).

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

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

tff(f_124,negated_conjecture,
    domain(one) != one,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

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

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_63,axiom,
    ! [A] : ( multiplication(A,one) = A ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).

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(c_38,plain,
    domain(one) != one,
    inference(cnfTransformation,[status(thm)],[f_124]) ).

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

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

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

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

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

tff(c_515,plain,
    multiplication(domain(one),one) = addition(one,domain(one)),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_491]) ).

tff(c_529,plain,
    domain(one) = one,
    inference(demodulation,[status(thm),theory(equality)],[c_194,c_12,c_515]) ).

tff(c_531,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_38,c_529]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : KLE058+1 : TPTP v9.0.0. Released v4.0.0.
% 0.11/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.34  % Computer : n026.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:34:53 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.50/1.85  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.50/1.85  
% 3.50/1.85  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------