↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL198-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/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 : n002.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:28 AM UTC 2026

% Result   : Unsatisfiable 33.60s 21.80s
% Output   : CNFRefutation 33.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   39 (  16 unt;   0 typ;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   65 (  34   ~;  31   |;   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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   83 (  83   !;   0   ?;   0   :)

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

%Foreground sorts:

%Background operators:

%Foreground operators:
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_58,axiom,
    ! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
    file(unknown,unknown) ).

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

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

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

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

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

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

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

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

tff(c_6,plain,
    ! [A_4,B_5] : axiom(or(not(or(A_4,B_5)),or(B_5,A_4))),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

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

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

tff(c_174,plain,
    ! [Y_51,Z_52,X_53] :
      ( ~ theorem(or(not(Y_51),Z_52))
      | ~ axiom(or(not(X_53),Y_51))
      | theorem(or(not(X_53),Z_52)) ),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_497,plain,
    ! [X_95,Y_96,Z_97] :
      ( ~ axiom(or(not(X_95),Y_96))
      | theorem(or(not(X_95),Z_97))
      | ~ axiom(or(not(Y_96),Z_97)) ),
    inference(resolution,[status(thm)],[c_12,c_174]) ).

tff(c_534,plain,
    ! [A_103,Z_104,B_105] :
      ( theorem(or(not(A_103),Z_104))
      | ~ axiom(or(not(or(B_105,A_103)),Z_104)) ),
    inference(resolution,[status(thm)],[c_4,c_497]) ).

tff(c_553,plain,
    ! [B_5,A_4] : theorem(or(not(B_5),or(B_5,A_4))),
    inference(resolution,[status(thm)],[c_6,c_534]) ).

tff(c_161,plain,
    ! [A_48,B_49,C_50] : axiom(or(not(or(not(A_48),B_49)),or(not(or(C_50,A_48)),or(C_50,B_49)))),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

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_75]) ).

tff(c_319,plain,
    ! [A_68,B_69,C_70] :
      ( ~ theorem(or(not(A_68),B_69))
      | theorem(or(not(or(C_70,A_68)),or(C_70,B_69))) ),
    inference(resolution,[status(thm)],[c_161,c_14]) ).

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_83]) ).

tff(c_1155,plain,
    ! [X_200,C_201,A_202,B_203] :
      ( ~ axiom(or(not(X_200),or(C_201,A_202)))
      | theorem(or(not(X_200),or(C_201,B_203)))
      | ~ theorem(or(not(A_202),B_203)) ),
    inference(resolution,[status(thm)],[c_319,c_16]) ).

tff(c_2568,plain,
    ! [A_345,B_346,B_347] :
      ( theorem(or(not(or(A_345,B_346)),or(B_346,B_347)))
      | ~ theorem(or(not(A_345),B_347)) ),
    inference(resolution,[status(thm)],[c_6,c_1155]) ).

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_60]) ).

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_9536,plain,
    ! [B_993,A_994,B_995] :
      ( theorem(or(B_993,or(not(or(A_994,B_993)),B_995)))
      | ~ theorem(or(not(A_994),B_995)) ),
    inference(resolution,[status(thm)],[c_2568,c_60]) ).

tff(c_36,plain,
    ! [A_25,B_26] : axiom(or(not(or(A_25,B_26)),or(B_26,A_25))),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_40,plain,
    ! [A_25,B_26] :
      ( ~ theorem(or(A_25,B_26))
      | theorem(or(B_26,A_25)) ),
    inference(resolution,[status(thm)],[c_36,c_14]) ).

tff(c_30047,plain,
    ! [A_3072,B_3073,B_3074] :
      ( theorem(or(or(not(or(A_3072,B_3073)),B_3074),B_3073))
      | ~ theorem(or(not(A_3072),B_3074)) ),
    inference(resolution,[status(thm)],[c_9536,c_40]) ).

tff(c_22,plain,
    ! [Y_22,X_23] :
      ( ~ theorem(Y_22)
      | ~ axiom(or(not(Y_22),X_23))
      | theorem(X_23) ),
    inference(cnfTransformation,[status(thm)],[f_75]) ).

tff(c_30,plain,
    ! [A_2,B_3] :
      ( ~ theorem(A_2)
      | theorem(or(B_3,A_2)) ),
    inference(resolution,[status(thm)],[c_4,c_22]) ).

tff(c_79,plain,
    ! [A_39,B_40,C_41] :
      ( ~ theorem(or(A_39,or(B_40,C_41)))
      | theorem(or(B_40,or(A_39,C_41))) ),
    inference(resolution,[status(thm)],[c_56,c_14]) ).

tff(c_195,plain,
    ! [B_54,B_55,C_56] :
      ( theorem(or(B_54,or(B_55,C_56)))
      | ~ theorem(or(B_54,C_56)) ),
    inference(resolution,[status(thm)],[c_30,c_79]) ).

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

tff(c_29,plain,
    ! [A_1] :
      ( ~ theorem(or(A_1,A_1))
      | theorem(A_1) ),
    inference(resolution,[status(thm)],[c_2,c_22]) ).

tff(c_214,plain,
    ! [B_55,C_56] :
      ( theorem(or(B_55,C_56))
      | ~ theorem(or(or(B_55,C_56),C_56)) ),
    inference(resolution,[status(thm)],[c_195,c_29]) ).

tff(c_30069,plain,
    ! [A_3075,B_3076] :
      ( theorem(or(not(or(A_3075,B_3076)),B_3076))
      | ~ theorem(or(not(A_3075),B_3076)) ),
    inference(resolution,[status(thm)],[c_30047,c_214]) ).

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

tff(c_30084,plain,
    ~ theorem(or(not(not(p)),or(not(p),q))),
    inference(resolution,[status(thm)],[c_30069,c_18]) ).

tff(c_30100,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_553,c_30084]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL198-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/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.09/0.36  % Computer : n002.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep  5 00:35:35 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 33.60/21.80  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 33.60/21.82  
% 33.60/21.82  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------