↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP715-10 : 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/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 : n016.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:04 PM UTC 2025

% Result   : Unsatisfiable 32.21s 18.37s
% Output   : CNFRefutation 32.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   31 (  31 unt;   0 typ;   0 def)
%            Number of atoms       :   31 (  30 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    5 (   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    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   33 (  33   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ plus > mult > #nlpp > minus > x0 > unit > op_b > op_a > op_0

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_42,axiom,
    mult(op_a,op_b) = unit,
    file(unknown,unknown) ).

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

tff(f_43,axiom,
    mult(op_b,op_a) = unit,
    file(unknown,unknown) ).

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

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

tff(f_45,axiom,
    mult(mult(x0,op_a),op_b) != x0,
    file(unknown,unknown) ).

tff(c_16,plain,
    ! [A_16] : ( mult(A_16,unit) = A_16 ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_20,plain,
    mult(op_a,op_b) = unit,
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_18,plain,
    ! [A_17] : ( mult(unit,A_17) = A_17 ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_22,plain,
    mult(op_b,op_a) = unit,
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_181,plain,
    ! [A_25,B_26] : ( mult(mult(A_25,B_26),B_26) = mult(A_25,mult(B_26,B_26)) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_213,plain,
    mult(op_b,mult(op_a,op_a)) = mult(unit,op_a),
    inference(superposition,[status(thm),theory(equality)],[c_22,c_181]) ).

tff(c_221,plain,
    mult(op_b,mult(op_a,op_a)) = op_a,
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_213]) ).

tff(c_14,plain,
    ! [A_14,B_15] : ( mult(mult(A_14,B_15),B_15) = mult(A_14,mult(B_15,B_15)) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_672,plain,
    ! [A_41,B_42,C_43] : ( mult(mult(mult(A_41,B_42),C_43),B_42) = mult(A_41,mult(mult(B_42,C_43),B_42)) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_15569,plain,
    ! [A_157,B_158,C_159] : ( mult(mult(A_157,mult(mult(B_158,C_159),B_158)),B_158) = mult(mult(mult(A_157,B_158),C_159),mult(B_158,B_158)) ),
    inference(superposition,[status(thm),theory(equality)],[c_672,c_14]) ).

tff(c_15830,plain,
    ! [A_157] : ( mult(mult(mult(A_157,op_a),op_b),mult(op_a,op_a)) = mult(mult(A_157,mult(unit,op_a)),op_a) ),
    inference(superposition,[status(thm),theory(equality)],[c_20,c_15569]) ).

tff(c_50997,plain,
    ! [A_281] : ( mult(mult(mult(A_281,op_a),op_b),mult(op_a,op_a)) = mult(A_281,mult(op_a,op_a)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_18,c_15830]) ).

tff(c_12,plain,
    ! [A_11,B_12,C_13] : ( mult(mult(mult(A_11,B_12),C_13),B_12) = mult(A_11,mult(mult(B_12,C_13),B_12)) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_51113,plain,
    ! [A_281] : ( mult(mult(A_281,op_a),mult(mult(op_b,mult(op_a,op_a)),op_b)) = mult(mult(A_281,mult(op_a,op_a)),op_b) ),
    inference(superposition,[status(thm),theory(equality)],[c_50997,c_12]) ).

tff(c_51220,plain,
    ! [A_282] : ( mult(mult(A_282,mult(op_a,op_a)),op_b) = mult(A_282,op_a) ),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_20,c_221,c_51113]) ).

tff(c_51349,plain,
    ! [A_11] : ( mult(A_11,mult(mult(op_b,mult(op_a,op_a)),op_b)) = mult(mult(A_11,op_b),op_a) ),
    inference(superposition,[status(thm),theory(equality)],[c_51220,c_12]) ).

tff(c_51446,plain,
    ! [A_11] : ( mult(mult(A_11,op_b),op_a) = A_11 ),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_20,c_221,c_51349]) ).

tff(c_51463,plain,
    ! [A_283] : ( mult(mult(A_283,op_b),op_a) = A_283 ),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_20,c_221,c_51349]) ).

tff(c_51690,plain,
    ! [A_284] : ( mult(mult(A_284,op_b),mult(op_a,op_a)) = mult(A_284,op_a) ),
    inference(superposition,[status(thm),theory(equality)],[c_51463,c_14]) ).

tff(c_51205,plain,
    ! [A_281] : ( mult(mult(A_281,mult(op_a,op_a)),op_b) = mult(A_281,op_a) ),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_20,c_221,c_51113]) ).

tff(c_51696,plain,
    ! [A_284] : ( mult(mult(A_284,op_b),op_a) = mult(mult(A_284,op_a),op_b) ),
    inference(superposition,[status(thm),theory(equality)],[c_51690,c_51205]) ).

tff(c_51902,plain,
    ! [A_284] : ( mult(mult(A_284,op_a),op_b) = A_284 ),
    inference(demodulation,[status(thm),theory(equality)],[c_51446,c_51696]) ).

tff(c_24,plain,
    mult(mult(x0,op_a),op_b) != x0,
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_51947,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_51902,c_24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09  % Problem  : GRP715-10 : TPTP v9.0.0. Released v8.1.0.
% 0.08/0.10  % 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.30  % Computer : n016.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Mon Apr  7 22:29:38 EDT 2025
% 0.09/0.30  % CPUTime  : 
% 32.21/18.37  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 32.21/18.38  
% 32.21/18.38  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------