↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP703-11 : TPTP v9.0.0. Released v8.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 : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Apr  9 06:27:02 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > x3 > x2 > unit > op_f > op_e > op_d > op_c

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(ld,type,
    ld: ( $i * $i ) > $i ).

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

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

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

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

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

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

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

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

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

tff(f_27,axiom,
    ! [A,B] : ( ld(A,mult(A,B)) = B ),
    file(unknown,unknown) ).

tff(f_25,axiom,
    ! [A,B] : ( mult(A,ld(A,B)) = B ),
    file(unknown,unknown) ).

tff(f_45,axiom,
    ! [A] : ( op_d = ld(A,mult(op_c,A)) ),
    file(unknown,unknown) ).

tff(f_43,axiom,
    ! [A,B] : ( mult(A,mult(op_c,B)) = mult(mult(A,op_c),B) ),
    file(unknown,unknown) ).

tff(f_39,axiom,
    ! [A,B] : ( mult(op_c,mult(A,B)) = mult(mult(op_c,A),B) ),
    file(unknown,unknown) ).

tff(f_29,axiom,
    ! [A,B] : ( mult(rd(A,B),B) = A ),
    file(unknown,unknown) ).

tff(f_35,axiom,
    ! [A] : ( mult(unit,A) = A ),
    file(unknown,unknown) ).

tff(f_47,axiom,
    ! [A,B] : ( op_e = mult(mult(rd(op_c,mult(A,B)),B),A) ),
    file(unknown,unknown) ).

tff(f_33,axiom,
    ! [A] : ( mult(A,unit) = A ),
    file(unknown,unknown) ).

tff(f_51,axiom,
    mult(x2,mult(x3,op_e)) != mult(mult(x2,x3),op_e),
    file(unknown,unknown) ).

tff(c_4,plain,
    ! [A_3,B_4] : ( ld(A_3,mult(A_3,B_4)) = B_4 ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_2,plain,
    ! [A_1,B_2] : ( mult(A_1,ld(A_1,B_2)) = B_2 ),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

tff(c_72,plain,
    ! [A_28,B_29] : ( ld(A_28,mult(A_28,B_29)) = B_29 ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_22,plain,
    ! [A_20] : ( ld(A_20,mult(op_c,A_20)) = op_d ),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_79,plain,
    op_d = op_c,
    inference(superposition,[status(thm),theory(equality)],[c_72,c_22]) ).

tff(c_266,plain,
    ! [A_40] : ( ld(A_40,mult(op_c,A_40)) = op_c ),
    inference(demodulation,[status(thm),theory(equality)],[c_79,c_22]) ).

tff(c_271,plain,
    ! [A_40] : ( mult(op_c,A_40) = mult(A_40,op_c) ),
    inference(superposition,[status(thm),theory(equality)],[c_266,c_2]) ).

tff(c_330,plain,
    ! [A_43,B_44] : ( mult(mult(A_43,op_c),B_44) = mult(A_43,mult(op_c,B_44)) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_7216,plain,
    ! [A_131,B_132] : ( mult(A_131,mult(op_c,ld(mult(A_131,op_c),B_132))) = B_132 ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_330]) ).

tff(c_1027,plain,
    ! [A_60,B_61] : ( mult(mult(op_c,A_60),B_61) = mult(op_c,mult(A_60,B_61)) ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_1093,plain,
    ! [B_2,B_61] : ( mult(op_c,mult(ld(op_c,B_2),B_61)) = mult(B_2,B_61) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_1027]) ).

tff(c_7260,plain,
    ! [B_2,B_132] : ( mult(B_2,mult(op_c,ld(mult(ld(op_c,B_2),op_c),B_132))) = mult(op_c,B_132) ),
    inference(superposition,[status(thm),theory(equality)],[c_7216,c_1093]) ).

tff(c_42279,plain,
    ! [B_347,B_348] : ( mult(B_347,mult(op_c,ld(B_347,B_348))) = mult(op_c,B_348) ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_271,c_7260]) ).

tff(c_42696,plain,
    ! [A_3,B_4] : ( mult(op_c,mult(A_3,B_4)) = mult(A_3,mult(op_c,B_4)) ),
    inference(superposition,[status(thm),theory(equality)],[c_4,c_42279]) ).

tff(c_6,plain,
    ! [A_5,B_6] : ( mult(rd(A_5,B_6),B_6) = A_5 ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_12,plain,
    ! [A_10] : ( mult(unit,A_10) = A_10 ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_686,plain,
    ! [A_53,B_54] : ( mult(mult(rd(op_c,mult(A_53,B_54)),B_54),A_53) = op_e ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_10,plain,
    ! [A_9] : ( mult(A_9,unit) = A_9 ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_717,plain,
    ! [B_54] : ( mult(rd(op_c,mult(unit,B_54)),B_54) = op_e ),
    inference(superposition,[status(thm),theory(equality)],[c_686,c_10]) ).

tff(c_765,plain,
    op_e = op_c,
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_12,c_717]) ).

tff(c_28,plain,
    mult(mult(x2,x3),op_e) != mult(x2,mult(x3,op_e)),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_773,plain,
    mult(mult(x2,x3),op_c) != mult(x2,mult(x3,op_c)),
    inference(demodulation,[status(thm),theory(equality)],[c_765,c_765,c_28]) ).

tff(c_774,plain,
    mult(x2,mult(op_c,x3)) != mult(op_c,mult(x2,x3)),
    inference(demodulation,[status(thm),theory(equality)],[c_271,c_271,c_773]) ).

tff(c_53213,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_42696,c_774]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP703-11 : TPTP v9.0.0. Released v8.1.0.
% 0.07/0.13  % 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.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Mon Apr  7 22:27:56 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 17.60/6.96  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.60/6.97  
% 17.60/6.97  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------