↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SWX233-1 : TPTP v9.3.0. Released v9.3.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 : n031.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 May  5 06:56:40 PM UTC 2026

% Result   : Unsatisfiable 2.38s 1.58s
% Output   : CNFRefutation 2.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            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 :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :    6 (   6   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ eq > cons > aux > #nlpp > prop1 > h > g > f > nil > btrue > bfalse

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(f_39,axiom,
    ! [X] : ( eq(X,X) = btrue ),
    file(unknown,unknown) ).

tff(f_37,axiom,
    eq(btrue,bfalse) = bfalse,
    file(unknown,unknown) ).

tff(f_31,axiom,
    f(nil) = btrue,
    file(unknown,unknown) ).

tff(f_35,axiom,
    ! [X] : ( prop1(X) = eq(f(X),bfalse) ),
    file(unknown,unknown) ).

tff(f_42,axiom,
    ! [X] : ( eq(prop1(X),bfalse) != btrue ),
    file(unknown,unknown) ).

tff(c_24,plain,
    ! [X_8] : ( eq(X_8,X_8) = btrue ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_22,plain,
    eq(btrue,bfalse) = bfalse,
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_14,plain,
    f(nil) = btrue,
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_82,plain,
    ! [X_16] : ( eq(f(X_16),bfalse) = prop1(X_16) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_91,plain,
    eq(btrue,bfalse) = prop1(nil),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_82]) ).

tff(c_94,plain,
    prop1(nil) = bfalse,
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_91]) ).

tff(c_26,plain,
    ! [X_9] : ( eq(prop1(X_9),bfalse) != btrue ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_97,plain,
    eq(bfalse,bfalse) != btrue,
    inference(superposition,[status(thm),theory(equality)],[c_94,c_26]) ).

tff(c_102,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_24,c_97]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWX233-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/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.16/0.34  % Computer : n031.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Tue May  5 13:09:09 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 2.38/1.58  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.38/1.58  
% 2.38/1.58  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------