↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SWC009-1 : TPTP v9.0.0. Released v2.4.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 : Wed Apr  9 09:18:52 PM UTC 2025

% Result   : Unsatisfiable 19.05s 7.37s
% Output   : CNFRefutation 19.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   28 (  21 unt;   0 typ;   0 def)
%            Number of atoms       :   45 (  22 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   39 (  22   ~;  17   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   21 (  19 usr;   1 prp; 0-2 aty)
%            Number of functors    :   54 (  54 usr;   8 con; 0-2 aty)
%            Number of variables   :   10 (  10   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ segmentP > rearsegP > neq > memberP > lt > leq > gt > geq > frontsegP > totalorderedP > totalorderP > strictorderedP > strictorderP > ssList > ssItem > singletonP > equalelemsP > duplicatefreeP > cyclefreeP > skaf48 > skaf47 > skaf46 > skaf45 > skaf43 > skaf42 > cons > app > #nlpp > tl > skaf83 > skaf82 > skaf81 > skaf80 > skaf79 > skaf78 > skaf77 > skaf76 > skaf75 > skaf74 > skaf73 > skaf72 > skaf71 > skaf70 > skaf69 > skaf68 > skaf67 > skaf66 > skaf65 > skaf64 > skaf63 > skaf62 > skaf61 > skaf60 > skaf59 > skaf58 > skaf57 > skaf56 > skaf55 > skaf54 > skaf53 > skaf52 > skaf51 > skaf50 > skaf49 > skaf44 > hd > skac3 > skac2 > sk5 > sk4 > sk3 > sk2 > sk1 > nil

%Foreground sorts:

%Background operators:

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

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

tff(totalorderedP,type,
    totalorderedP: $i > $o ).

tff(equalelemsP,type,
    equalelemsP: $i > $o ).

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

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

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

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

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

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

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

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

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

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

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

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

tff(singletonP,type,
    singletonP: $i > $o ).

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

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

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

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

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

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

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

tff(totalorderP,type,
    totalorderP: $i > $o ).

tff(ssItem,type,
    ssItem: $i > $o ).

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

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

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

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

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

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

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

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

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

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

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

tff(duplicatefreeP,type,
    duplicatefreeP: $i > $o ).

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

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

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

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

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

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

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

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

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

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

tff(ssList,type,
    ssList: $i > $o ).

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

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

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

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

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

tff(strictorderP,type,
    strictorderP: $i > $o ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(strictorderedP,type,
    strictorderedP: $i > $o ).

tff(cyclefreeP,type,
    cyclefreeP: $i > $o ).

tff(f_1649,axiom,
    sk2 = sk4,
    file(unknown,unknown) ).

tff(f_1648,axiom,
    ssList(sk4),
    file(unknown,unknown) ).

tff(f_245,axiom,
    ! [U] :
      ( ~ ssList(U)
      | ( app(U,nil) = U ) ),
    file(unknown,unknown) ).

tff(f_1650,axiom,
    sk1 = sk3,
    file(unknown,unknown) ).

tff(f_1647,axiom,
    ssList(sk3),
    file(unknown,unknown) ).

tff(f_56,axiom,
    ssList(nil),
    file(unknown,unknown) ).

tff(f_1666,axiom,
    ssList(sk5),
    file(unknown,unknown) ).

tff(f_1667,axiom,
    app(sk3,sk5) = sk4,
    file(unknown,unknown) ).

tff(f_1665,axiom,
    ! [A,B,C] :
      ( ~ ssList(A)
      | ~ ssList(B)
      | ~ ssList(C)
      | ( app(app(A,B),C) != sk2 )
      | ( app(A,C) != sk1 ) ),
    file(unknown,unknown) ).

tff(c_380,plain,
    sk4 = sk2,
    inference(cnfTransformation,[status(thm)],[f_1649]) ).

tff(c_378,plain,
    ssList(sk4),
    inference(cnfTransformation,[status(thm)],[f_1648]) ).

tff(c_401,plain,
    ssList(sk2),
    inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).

tff(c_599,plain,
    ! [U_395] :
      ( ( app(U_395,nil) = U_395 )
      | ~ ssList(U_395) ),
    inference(cnfTransformation,[status(thm)],[f_245]) ).

tff(c_722,plain,
    app(sk2,nil) = sk2,
    inference(resolution,[status(thm)],[c_401,c_599]) ).

tff(c_382,plain,
    sk3 = sk1,
    inference(cnfTransformation,[status(thm)],[f_1650]) ).

tff(c_376,plain,
    ssList(sk3),
    inference(cnfTransformation,[status(thm)],[f_1647]) ).

tff(c_402,plain,
    ssList(sk1),
    inference(demodulation,[status(thm),theory(equality)],[c_382,c_376]) ).

tff(c_721,plain,
    app(sk1,nil) = sk1,
    inference(resolution,[status(thm)],[c_402,c_599]) ).

tff(c_16,plain,
    ssList(nil),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_386,plain,
    ssList(sk5),
    inference(cnfTransformation,[status(thm)],[f_1666]) ).

tff(c_388,plain,
    app(sk3,sk5) = sk4,
    inference(cnfTransformation,[status(thm)],[f_1667]) ).

tff(c_398,plain,
    app(sk1,sk5) = sk4,
    inference(demodulation,[status(thm),theory(equality)],[c_382,c_388]) ).

tff(c_400,plain,
    app(sk1,sk5) = sk2,
    inference(demodulation,[status(thm),theory(equality)],[c_380,c_398]) ).

tff(c_7278,plain,
    ! [A_821,C_822,B_823] :
      ( ( app(A_821,C_822) != sk1 )
      | ( app(app(A_821,B_823),C_822) != sk2 )
      | ~ ssList(C_822)
      | ~ ssList(B_823)
      | ~ ssList(A_821) ),
    inference(cnfTransformation,[status(thm)],[f_1665]) ).

tff(c_7444,plain,
    ! [C_822] :
      ( ( app(sk1,C_822) != sk1 )
      | ( app(sk2,C_822) != sk2 )
      | ~ ssList(C_822)
      | ~ ssList(sk5)
      | ~ ssList(sk1) ),
    inference(superposition,[status(thm),theory(equality)],[c_400,c_7278]) ).

tff(c_16515,plain,
    ! [C_1501] :
      ( ( app(sk1,C_1501) != sk1 )
      | ( app(sk2,C_1501) != sk2 )
      | ~ ssList(C_1501) ),
    inference(demodulation,[status(thm),theory(equality)],[c_402,c_386,c_7444]) ).

tff(c_16608,plain,
    ( ( app(sk1,nil) != sk1 )
    | ( app(sk2,nil) != sk2 ) ),
    inference(resolution,[status(thm)],[c_16,c_16515]) ).

tff(c_16651,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_722,c_721,c_16608]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC009-1 : TPTP v9.0.0. Released v2.4.0.
% 0.07/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 : n031.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 : Wed Apr  9 01:17:52 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 19.05/7.37  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 19.05/7.38  
% 19.05/7.38  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------