↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL323-3 : TPTP v9.3.1. Released v2.3.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:43 AM UTC 2026

% Result   : Unsatisfiable 17.02s 7.51s
% Output   : CNFRefutation 17.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   40 (  20 unt;   0 typ;   0 def)
%            Number of atoms       :   68 (   2 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   60 (  32   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   87 (  87   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > #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(implies,type,
    implies: ( $i * $i ) > $i ).

tff(f_50,axiom,
    ! [A,B] : axiom(implies(or(A,B),or(B,A))),
    file(unknown,unknown) ).

tff(f_48,axiom,
    ! [A,B] : axiom(implies(A,or(B,A))),
    file(unknown,unknown) ).

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

tff(f_56,axiom,
    ! [X,Y] : ( implies(X,Y) = or(not(X),Y) ),
    file(unknown,unknown) ).

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

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

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

tff(f_77,axiom,
    ~ theorem(or(implies(p,q),implies(q,r))),
    file(unknown,unknown) ).

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

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

tff(c_14,plain,
    ! [X_14] :
      ( ~ axiom(X_14)
      | theorem(X_14) ),
    inference(cnfTransformation,[status(thm)],[f_61]) ).

tff(c_12,plain,
    ! [X_12,Y_13] : ( or(not(X_12),Y_13) = implies(X_12,Y_13) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_55,plain,
    ! [A_29,B_30,C_31] : axiom(implies(implies(A_29,B_30),implies(or(C_31,A_29),or(C_31,B_30)))),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_61,plain,
    ! [A_29,Y_13,X_12] : axiom(implies(implies(A_29,Y_13),implies(or(not(X_12),A_29),implies(X_12,Y_13)))),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_55]) ).

tff(c_367,plain,
    ! [A_75,Y_76,X_77] : axiom(implies(implies(A_75,Y_76),implies(implies(X_77,A_75),implies(X_77,Y_76)))),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_61]) ).

tff(c_50,plain,
    ! [Y_27,X_28] :
      ( ~ theorem(Y_27)
      | ~ theorem(implies(Y_27,X_28))
      | theorem(X_28) ),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_54,plain,
    ! [Y_27,X_28] :
      ( ~ theorem(Y_27)
      | theorem(X_28)
      | ~ axiom(implies(Y_27,X_28)) ),
    inference(resolution,[status(thm)],[c_14,c_50]) ).

tff(c_1152,plain,
    ! [A_162,Y_163,X_164] :
      ( ~ theorem(implies(A_162,Y_163))
      | theorem(implies(implies(X_164,A_162),implies(X_164,Y_163))) ),
    inference(resolution,[status(thm)],[c_367,c_54]) ).

tff(c_16,plain,
    ! [Y_16,X_15] :
      ( ~ theorem(Y_16)
      | ~ theorem(implies(Y_16,X_15))
      | theorem(X_15) ),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_3290,plain,
    ! [X_304,A_305,Y_306] :
      ( ~ theorem(implies(X_304,A_305))
      | theorem(implies(X_304,Y_306))
      | ~ theorem(implies(A_305,Y_306)) ),
    inference(resolution,[status(thm)],[c_1152,c_16]) ).

tff(c_4657,plain,
    ! [X_379,Y_380,A_381] :
      ( theorem(implies(X_379,Y_380))
      | ~ theorem(implies(A_381,Y_380))
      | ~ axiom(implies(X_379,A_381)) ),
    inference(resolution,[status(thm)],[c_14,c_3290]) ).

tff(c_20005,plain,
    ! [X_993,Y_994,A_995] :
      ( theorem(implies(X_993,Y_994))
      | ~ axiom(implies(X_993,A_995))
      | ~ axiom(implies(A_995,Y_994)) ),
    inference(resolution,[status(thm)],[c_14,c_4657]) ).

tff(c_20188,plain,
    ! [A_1000,Y_1001,B_1002] :
      ( theorem(implies(A_1000,Y_1001))
      | ~ axiom(implies(or(B_1002,A_1000),Y_1001)) ),
    inference(resolution,[status(thm)],[c_4,c_20005]) ).

tff(c_20218,plain,
    ! [B_5,A_4] : theorem(implies(B_5,or(B_5,A_4))),
    inference(resolution,[status(thm)],[c_6,c_20188]) ).

tff(c_120,plain,
    ! [A_39,B_40,C_41] : axiom(implies(or(A_39,or(B_40,C_41)),or(B_40,or(A_39,C_41)))),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_130,plain,
    ! [X_12,B_40,C_41] : axiom(implies(implies(X_12,or(B_40,C_41)),or(B_40,or(not(X_12),C_41)))),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_120]) ).

tff(c_316,plain,
    ! [X_64,B_65,C_66] : axiom(implies(implies(X_64,or(B_65,C_66)),or(B_65,implies(X_64,C_66)))),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_130]) ).

tff(c_533,plain,
    ! [X_107,B_108,C_109] :
      ( ~ theorem(implies(X_107,or(B_108,C_109)))
      | theorem(or(B_108,implies(X_107,C_109))) ),
    inference(resolution,[status(thm)],[c_316,c_54]) ).

tff(c_64,plain,
    ! [Y_32,X_33] :
      ( ~ theorem(Y_32)
      | theorem(X_33)
      | ~ axiom(implies(Y_32,X_33)) ),
    inference(resolution,[status(thm)],[c_14,c_50]) ).

tff(c_81,plain,
    ! [A_4,B_5] :
      ( ~ theorem(or(A_4,B_5))
      | theorem(or(B_5,A_4)) ),
    inference(resolution,[status(thm)],[c_6,c_64]) ).

tff(c_1640,plain,
    ! [X_214,C_215,B_216] :
      ( theorem(or(implies(X_214,C_215),B_216))
      | ~ theorem(implies(X_214,or(B_216,C_215))) ),
    inference(resolution,[status(thm)],[c_533,c_81]) ).

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

tff(c_444,plain,
    ! [A_92,B_93,C_94] :
      ( ~ theorem(or(A_92,or(B_93,C_94)))
      | theorem(or(B_93,or(A_92,C_94))) ),
    inference(resolution,[status(thm)],[c_120,c_54]) ).

tff(c_615,plain,
    ! [B_116,B_117,C_118] :
      ( theorem(or(B_116,or(B_117,C_118)))
      | ~ theorem(or(B_116,C_118)) ),
    inference(resolution,[status(thm)],[c_84,c_444]) ).

tff(c_635,plain,
    ! [B_119,C_120,B_121] :
      ( theorem(or(or(B_119,C_120),B_121))
      | ~ theorem(or(B_121,C_120)) ),
    inference(resolution,[status(thm)],[c_615,c_81]) ).

tff(c_868,plain,
    ! [X_139,Y_140,B_141] :
      ( theorem(or(implies(X_139,Y_140),B_141))
      | ~ theorem(or(B_141,Y_140)) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_635]) ).

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

tff(c_903,plain,
    ~ theorem(or(implies(q,r),q)),
    inference(resolution,[status(thm)],[c_868,c_18]) ).

tff(c_1679,plain,
    ~ theorem(implies(q,or(q,r))),
    inference(resolution,[status(thm)],[c_1640,c_903]) ).

tff(c_20225,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_20218,c_1679]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL323-3 : TPTP v9.3.1. Released v2.3.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 : Sun Sep  6 02:06:50 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 17.02/7.51  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.02/7.52  
% 17.02/7.52  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------