↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL230-1 : TPTP v9.3.1. Released v1.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   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 11:11:34 AM UTC 2026

% Result   : Unsatisfiable 25.90s 14.69s
% Output   : CNFRefutation 26.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   31 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   56 (  30   ~;  26   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   68 (  68   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ theorem > axiom > or > #nlpp > not > r > q > p

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

tff(f_53,axiom,
    ! [A] : axiom(or(not(or(A,A)),A)),
    file(unknown,unknown) ).

tff(f_55,axiom,
    ! [A,B] : axiom(or(not(A),or(B,A))),
    file(unknown,unknown) ).

tff(f_66,axiom,
    ! [X] :
      ( theorem(X)
      | ~ axiom(X) ),
    file(unknown,unknown) ).

tff(f_82,axiom,
    ! [X,Z,Y] :
      ( theorem(or(not(X),Z))
      | ~ axiom(or(not(X),Y))
      | ~ theorem(or(not(Y),Z)) ),
    file(unknown,unknown) ).

tff(f_61,axiom,
    ! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
    file(unknown,unknown) ).

tff(f_74,axiom,
    ! [X,Y] :
      ( theorem(X)
      | ~ axiom(or(not(Y),X))
      | ~ theorem(Y) ),
    file(unknown,unknown) ).

tff(f_59,axiom,
    ! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
    file(unknown,unknown) ).

tff(f_86,axiom,
    ~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_4,plain,
    ! [A_2,B_3] : axiom(or(not(A_2),or(B_3,A_2))),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_12,plain,
    ! [X_12] :
      ( ~ axiom(X_12)
      | theorem(X_12) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_121,plain,
    ! [Y_48,Z_49,X_50] :
      ( ~ theorem(or(not(Y_48),Z_49))
      | ~ axiom(or(not(X_50),Y_48))
      | theorem(or(not(X_50),Z_49)) ),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_358,plain,
    ! [X_73,Y_74,Z_75] :
      ( ~ axiom(or(not(X_73),Y_74))
      | theorem(or(not(X_73),Z_75))
      | ~ axiom(or(not(Y_74),Z_75)) ),
    inference(resolution,[status(thm)],[c_12,c_121]) ).

tff(c_441,plain,
    ! [A_86,Z_87,B_88] :
      ( theorem(or(not(A_86),Z_87))
      | ~ axiom(or(not(or(B_88,A_86)),Z_87)) ),
    inference(resolution,[status(thm)],[c_4,c_358]) ).

tff(c_461,plain,
    ! [A_1] : theorem(or(not(A_1),A_1)),
    inference(resolution,[status(thm)],[c_2,c_441]) ).

tff(c_211,plain,
    ! [A_59,B_60,C_61] : axiom(or(not(or(not(A_59),B_60)),or(not(or(C_61,A_59)),or(C_61,B_60)))),
    inference(cnfTransformation,[status(thm)],[f_61]) ).

tff(c_14,plain,
    ! [Y_14,X_13] :
      ( ~ theorem(Y_14)
      | ~ axiom(or(not(Y_14),X_13))
      | theorem(X_13) ),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

tff(c_328,plain,
    ! [A_70,B_71,C_72] :
      ( ~ theorem(or(not(A_70),B_71))
      | theorem(or(not(or(C_72,A_70)),or(C_72,B_71))) ),
    inference(resolution,[status(thm)],[c_211,c_14]) ).

tff(c_56,plain,
    ! [A_32,B_33,C_34] : axiom(or(not(or(A_32,or(B_33,C_34))),or(B_33,or(A_32,C_34)))),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_60,plain,
    ! [A_32,B_33,C_34] :
      ( ~ theorem(or(A_32,or(B_33,C_34)))
      | theorem(or(B_33,or(A_32,C_34))) ),
    inference(resolution,[status(thm)],[c_56,c_14]) ).

tff(c_962,plain,
    ! [C_167,A_168,B_169] :
      ( theorem(or(C_167,or(not(or(C_167,A_168)),B_169)))
      | ~ theorem(or(not(A_168),B_169)) ),
    inference(resolution,[status(thm)],[c_328,c_60]) ).

tff(c_16,plain,
    ! [Y_17,Z_16,X_15] :
      ( ~ theorem(or(not(Y_17),Z_16))
      | ~ axiom(or(not(X_15),Y_17))
      | theorem(or(not(X_15),Z_16)) ),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_7598,plain,
    ! [X_913,Y_914,A_915,B_916] :
      ( ~ axiom(or(not(X_913),Y_914))
      | theorem(or(not(X_913),or(not(or(not(Y_914),A_915)),B_916)))
      | ~ theorem(or(not(A_915),B_916)) ),
    inference(resolution,[status(thm)],[c_962,c_16]) ).

tff(c_22589,plain,
    ! [Y_2413,A_2414,X_2415,B_2416] :
      ( theorem(or(not(or(not(Y_2413),A_2414)),or(not(X_2415),B_2416)))
      | ~ axiom(or(not(X_2415),Y_2413))
      | ~ theorem(or(not(A_2414),B_2416)) ),
    inference(resolution,[status(thm)],[c_7598,c_60]) ).

tff(c_8,plain,
    ! [A_6,B_7,C_8] : axiom(or(not(or(A_6,or(B_7,C_8))),or(B_7,or(A_6,C_8)))),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_1360,plain,
    ! [X_229,C_230,A_231,B_232] :
      ( ~ axiom(or(not(X_229),or(C_230,A_231)))
      | theorem(or(not(X_229),or(C_230,B_232)))
      | ~ theorem(or(not(A_231),B_232)) ),
    inference(resolution,[status(thm)],[c_328,c_16]) ).

tff(c_6488,plain,
    ! [A_772,B_773,C_774,B_775] :
      ( theorem(or(not(or(A_772,or(B_773,C_774))),or(B_773,B_775)))
      | ~ theorem(or(not(or(A_772,C_774)),B_775)) ),
    inference(resolution,[status(thm)],[c_8,c_1360]) ).

tff(c_18,plain,
    ~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
    inference(cnfTransformation,[status(thm)],[f_86]) ).

tff(c_6501,plain,
    ~ theorem(or(not(or(not(or(p,q)),r)),or(not(q),r))),
    inference(resolution,[status(thm)],[c_6488,c_18]) ).

tff(c_22595,plain,
    ( ~ axiom(or(not(q),or(p,q)))
    | ~ theorem(or(not(r),r)) ),
    inference(resolution,[status(thm)],[c_22589,c_6501]) ).

tff(c_22611,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_461,c_4,c_22595]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL230-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % 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.10/0.37  % Computer : n013.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Fri Sep  4 14:41:20 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 25.90/14.69  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.00/14.70  
% 26.00/14.70  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------