↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL414-1 : TPTP v9.3.1. Released v2.5.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 : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 11:11:53 AM UTC 2026

% Result   : Unsatisfiable 2.94s 2.20s
% Output   : CNFRefutation 3.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   13 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   21 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   18 (  10   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   23 (  23   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ a_truth > implies > #nlpp > not > sk1

%Foreground sorts:

%Background operators:

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

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

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

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

tff(f_31,axiom,
    ! [A,B] : a_truth(implies(A,implies(B,A))),
    file(unknown,unknown) ).

tff(f_33,axiom,
    ! [A,B,C] : a_truth(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))),
    file(unknown,unknown) ).

tff(f_29,axiom,
    ! [B,A] :
      ( a_truth(B)
      | ~ a_truth(A)
      | ~ a_truth(implies(A,B)) ),
    file(unknown,unknown) ).

tff(f_37,axiom,
    ~ a_truth(implies(sk1,sk1)),
    file(unknown,unknown) ).

tff(c_4,plain,
    ! [A_3,B_4] : a_truth(implies(A_3,implies(B_4,A_3))),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_49,plain,
    ! [A_22,B_23,C_24] : a_truth(implies(implies(A_22,implies(B_23,C_24)),implies(implies(A_22,B_23),implies(A_22,C_24)))),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_2,plain,
    ! [A_2,B_1] :
      ( ~ a_truth(implies(A_2,B_1))
      | ~ a_truth(A_2)
      | a_truth(B_1) ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_57,plain,
    ! [A_28,B_29,C_30] :
      ( ~ a_truth(implies(A_28,implies(B_29,C_30)))
      | a_truth(implies(implies(A_28,B_29),implies(A_28,C_30))) ),
    inference(resolution,[status(thm)],[c_49,c_2]) ).

tff(c_62,plain,
    ! [A_31,B_32,C_33] :
      ( ~ a_truth(implies(A_31,B_32))
      | a_truth(implies(A_31,C_33))
      | ~ a_truth(implies(A_31,implies(B_32,C_33))) ),
    inference(resolution,[status(thm)],[c_57,c_2]) ).

tff(c_89,plain,
    ! [A_34,B_35] :
      ( ~ a_truth(implies(A_34,B_35))
      | a_truth(implies(A_34,A_34)) ),
    inference(resolution,[status(thm)],[c_4,c_62]) ).

tff(c_107,plain,
    ! [A_3] : a_truth(implies(A_3,A_3)),
    inference(resolution,[status(thm)],[c_4,c_89]) ).

tff(c_10,plain,
    ~ a_truth(implies(sk1,sk1)),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL414-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % 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.10/0.36  % Computer : n011.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Fri Sep  4 20:09:28 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 2.94/2.20  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.08/2.20  
% 3.08/2.20  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------