↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SWV377+1 : TPTP v9.0.0. Released v3.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 : n017.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:30:22 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ pair_in_list > succ_cpq > strictly_less_than > less_than > contains_slb > contains_cpq > ok > isnonempty_slb > check_cpq > triple > update_slb > remove_slb > remove_pqp > remove_cpq > pair > lookup_slb > insert_slb > insert_pqp > insert_cpq > #nlpp > removemin_cpq_res > removemin_cpq_eff > findmin_pqp_res > findmin_cpq_res > findmin_cpq_eff > create_slb > bottom > bad > #skF_2 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff('#skF_2',type,
    '#skF_2': $i ).

tff('#skF_3',type,
    '#skF_3': $i ).

tff('#skF_1',type,
    '#skF_1': $i ).

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

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

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

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

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

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

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

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

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

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

tff('#skF_4',type,
    '#skF_4': $i ).

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

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

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

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

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

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

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

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

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

tff(f_224,axiom,
    ! [U,V,W,X] : ( insert_cpq(triple(U,V,W),X) = triple(insert_pqp(U,X),insert_slb(V,pair(X,bottom)),W) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax42) ).

tff(f_222,axiom,
    ! [U,V,W] :
      ( ~ ok(triple(U,V,W))
     => ( W = bad ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax41) ).

tff(f_292,negated_conjecture,
    ~ ! [U,V,W,X] :
        ( ~ ok(triple(U,V,W))
       => ~ ok(insert_cpq(triple(U,V,W),X)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l13_co) ).

tff(f_217,axiom,
    ! [U,V] :
      ( ok(triple(U,V,bad))
    <=> $false ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).

tff(c_782,plain,
    ! [U_257,X_258,V_259,W_260] : ( triple(insert_pqp(U_257,X_258),insert_slb(V_259,pair(X_258,bottom)),W_260) = insert_cpq(triple(U_257,V_259,W_260),X_258) ),
    inference(cnfTransformation,[status(thm)],[f_224]) ).

tff(c_170,plain,
    ! [W_149,U_150,V_151] :
      ( ( bad = W_149 )
      | ok(triple(U_150,V_151,W_149)) ),
    inference(cnfTransformation,[status(thm)],[f_222]) ).

tff(c_104,plain,
    ~ ok(triple('#skF_1','#skF_2','#skF_3')),
    inference(cnfTransformation,[status(thm)],[f_292]) ).

tff(c_180,plain,
    bad = '#skF_3',
    inference(resolution,[status(thm)],[c_170,c_104]) ).

tff(c_74,plain,
    ! [U_75,V_76] : ~ ok(triple(U_75,V_76,bad)),
    inference(cnfTransformation,[status(thm)],[f_217]) ).

tff(c_182,plain,
    ! [U_75,V_76] : ~ ok(triple(U_75,V_76,'#skF_3')),
    inference(demodulation,[status(thm),theory(equality)],[c_180,c_74]) ).

tff(c_807,plain,
    ! [U_257,V_259,X_258] : ~ ok(insert_cpq(triple(U_257,V_259,'#skF_3'),X_258)),
    inference(superposition,[status(thm),theory(equality)],[c_782,c_182]) ).

tff(c_102,plain,
    ok(insert_cpq(triple('#skF_1','#skF_2','#skF_3'),'#skF_4')),
    inference(cnfTransformation,[status(thm)],[f_292]) ).

tff(c_815,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_807,c_102]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem  : SWV377+1 : TPTP v9.0.0. Released v3.3.0.
% 0.06/0.07  % 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.06/0.26  % Computer : n017.cluster.edu
% 0.06/0.26  % Model    : x86_64 x86_64
% 0.06/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26  % Memory   : 8042.1875MB
% 0.06/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26  % CPULimit : 300
% 0.06/0.26  % WCLimit  : 300
% 0.06/0.26  % DateTime : Wed Apr  9 03:09:25 EDT 2025
% 0.06/0.26  % CPUTime  : 
% 4.05/1.88  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.05/1.88  
% 4.05/1.88  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------