↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : DAT079_1 : TPTP v9.0.0. Released v6.1.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 : Wed Apr  9 06:08:04 PM UTC 2025

% Result   : Theorem 3.52s 1.85s
% Output   : CNFRefutation 3.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    7 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   12 (   3 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :    9 (   4   ~;   2   |;   2   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number arithmetic     :   17 (   0 atm;   0 fun;  11 num;   6 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  13 usr;   4 con; 0-2 aty)
%            Number of variables   :   11 (   7   !;   4   ?;  11   :)

% Comments : 
%------------------------------------------------------------------------------
%$ inRange > in > count > cons > append > #nlpp > tail > length > head > nil > #skF_4 > #skF_1 > #skF_2 > #skF_6 > #skF_3 > #skF_5

%Foreground sorts:
tff(list,type,
    list: $tType ).

%Background operators:

%Foreground operators:
tff(inRange,type,
    inRange: ( $int * list ) > $o ).

tff(tail,type,
    tail: list > list ).

tff(nil,type,
    nil: list ).

tff(head,type,
    head: list > $int ).

tff(length,type,
    length: list > $int ).

tff('#skF_4',type,
    '#skF_4': ( $int * list ) > list ).

tff(append,type,
    append: ( list * list ) > list ).

tff(count,type,
    count: ( $int * list ) > $int ).

tff(cons,type,
    cons: ( $int * list ) > list ).

tff(in,type,
    in: ( $int * list ) > $o ).

tff('#skF_1',type,
    '#skF_1': ( $int * list ) > $int ).

tff('#skF_2',type,
    '#skF_2': ( $int * list ) > list ).

tff('#skF_6',type,
    '#skF_6': ( $int * list ) > list ).

tff('#skF_3',type,
    '#skF_3': ( $int * list ) > $int ).

tff('#skF_5',type,
    '#skF_5': ( $int * list ) > $int ).

tff(f_54,axiom,
    ! [Xa: $int,L: list] :
      ( in(Xa,L)
    <=> ( ? [Ha: $int,T: list] :
            ( ( L = cons(Ha,T) )
            & ( Xa = Ha ) )
        | ? [Ha: $int,T: list] :
            ( ( L = cons(Ha,T) )
            & in(Xa,T) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_conv) ).

tff(f_95,negated_conjecture,
    ~ in(2,cons(1,cons(2,cons(3,nil)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).

tff(c_72,plain,
    ! [H_18a: $int,T_19: list] : in(H_18a,cons(H_18a,T_19)),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_73,plain,
    ! [X_8a: $int,T_21: list,H_20a: $int] :
      ( ~ in(X_8a,T_21)
      | in(X_8a,cons(H_20a,T_21)) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_57,plain,
    ~ in(2,cons(1,cons(2,cons(3,nil)))),
    inference(cnfTransformation,[status(thm)],[f_95]) ).

tff(c_132,plain,
    ~ in(2,cons(2,cons(3,nil))),
    inference(resolution,[status(thm)],[c_73,c_57]) ).

tff(c_136,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_72,c_132]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : DAT079_1 : TPTP v9.0.0. Released v6.1.0.
% 0.10/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.14/0.34  % Computer : n013.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Mon Apr  7 18:17:17 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 3.52/1.85  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.52/1.85  
% 3.52/1.85  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------