↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL190-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 : n005.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:27 AM UTC 2026

% Result   : Unsatisfiable 5.12s 2.94s
% Output   : CNFRefutation 5.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   15 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   24 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  13   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   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  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   21 (  21   !;   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_61,axiom,
    ! [X] :
      ( theorem(X)
      | ~ axiom(X) ),
    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_77,axiom,
    ~ theorem(implies(or(p,or(q,r)),or(p,or(r,q)))),
    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_14,plain,
    ! [X_14] :
      ( ~ axiom(X_14)
      | theorem(X_14) ),
    inference(cnfTransformation,[status(thm)],[f_61]) ).

tff(c_147,plain,
    ! [A_40,B_41,C_42] : axiom(implies(implies(A_40,B_41),implies(or(C_42,A_40),or(C_42,B_41)))),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_39,plain,
    ! [Y_25,X_26] :
      ( ~ theorem(Y_25)
      | ~ theorem(implies(Y_25,X_26))
      | theorem(X_26) ),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_43,plain,
    ! [Y_25,X_26] :
      ( ~ theorem(Y_25)
      | theorem(X_26)
      | ~ axiom(implies(Y_25,X_26)) ),
    inference(resolution,[status(thm)],[c_14,c_39]) ).

tff(c_1069,plain,
    ! [A_161,B_162,C_163] :
      ( ~ theorem(implies(A_161,B_162))
      | theorem(implies(or(C_163,A_161),or(C_163,B_162))) ),
    inference(resolution,[status(thm)],[c_147,c_43]) ).

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

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

tff(c_1103,plain,
    ~ axiom(implies(or(q,r),or(r,q))),
    inference(resolution,[status(thm)],[c_14,c_1085]) ).

tff(c_1111,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_1103]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL190-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 : n005.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 20:36:20 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 5.12/2.94  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.12/2.95  
% 5.12/2.95  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------