↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : KLE074+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 : n019.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:44 PM UTC 2025

% Result   : Theorem 2.60s 1.59s
% Output   : CNFRefutation 2.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    8 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :    8 (   7 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    6 (   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    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   13 (  13   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > domain > zero > one > #skF_2 > #skF_3 > #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_3',type,
    '#skF_3': $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_63,axiom,
    ! [A,B,C] : ( multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).

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

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

tff(c_10,plain,
    ! [A_8,B_9,C_10] : ( multiplication(multiplication(A_8,B_9),C_10) = multiplication(A_8,multiplication(B_9,C_10)) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_30,plain,
    ! [X0_24,X1_25] : ( domain(multiplication(X0_24,domain(X1_25))) = domain(multiplication(X0_24,X1_25)) ),
    inference(cnfTransformation,[status(thm)],[f_117]) ).

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

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

tff(c_41,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_39]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : KLE074+1 : TPTP v9.0.0. Released v4.0.0.
% 0.10/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 : n019.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:47 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.60/1.59  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.60/1.60  
% 2.60/1.60  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------