%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP656+1 : TPTP v9.0.0. Released v4.0.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 : n021.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:26:52 PM UTC 2025
% Result : Theorem 4.21s 2.11s
% Output : CNFRefutation 4.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 21 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 1 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 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 : 5 ( 5 usr; 0 con; 1-2 aty)
% Number of variables : 40 ( 39 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_28,axiom,
! [B,A] : ( mult(A,ld(A,B)) = B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
tff(f_36,axiom,
! [C,B,A] : ( mult(mult(A,B),mult(C,A)) = mult(mult(A,mult(B,C)),A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
tff(f_30,axiom,
! [B,A] : ( ld(A,mult(A,B)) = B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
tff(f_34,axiom,
! [B,A] : ( rd(mult(A,B),B) = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
tff(f_42,negated_conjecture,
~ ? [X0] :
! [X1] :
( ( mult(X1,X0) = X1 )
& ( mult(X0,X1) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(c_2,plain,
! [A_2,B_1] : ( mult(A_2,ld(A_2,B_1)) = B_1 ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_114,plain,
! [A_27,B_28,C_29] : ( mult(mult(A_27,mult(B_28,C_29)),A_27) = mult(mult(A_27,B_28),mult(C_29,A_27)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_241,plain,
! [A_36,A_37,B_38] : ( mult(mult(A_36,A_37),mult(ld(A_37,B_38),A_36)) = mult(mult(A_36,B_38),A_36) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_114]) ).
tff(c_4,plain,
! [A_4,B_3] : ( ld(A_4,mult(A_4,B_3)) = B_3 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_410,plain,
! [A_42,A_43,B_44] : ( ld(mult(A_42,A_43),mult(mult(A_42,B_44),A_42)) = mult(ld(A_43,B_44),A_42) ),
inference(superposition,[status(thm),theory(equality)],[c_241,c_4]) ).
tff(c_426,plain,
! [B_44,A_42] : ( mult(ld(B_44,B_44),A_42) = A_42 ),
inference(superposition,[status(thm),theory(equality)],[c_410,c_4]) ).
tff(c_627,plain,
! [B_48,A_49] : ( mult(ld(B_48,B_48),A_49) = A_49 ),
inference(superposition,[status(thm),theory(equality)],[c_410,c_4]) ).
tff(c_8,plain,
! [A_8,B_7] : ( rd(mult(A_8,B_7),B_7) = A_8 ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_695,plain,
! [A_49,B_48] : ( rd(A_49,A_49) = ld(B_48,B_48) ),
inference(superposition,[status(thm),theory(equality)],[c_627,c_8]) ).
tff(c_764,plain,
! [A_52,B_53] : ( rd(A_52,A_52) = ld(B_53,B_53) ),
inference(superposition,[status(thm),theory(equality)],[c_627,c_8]) ).
tff(c_1142,plain,
! [B_62,A_63] : ( mult(B_62,rd(A_63,A_63)) = B_62 ),
inference(superposition,[status(thm),theory(equality)],[c_764,c_2]) ).
tff(c_12,plain,
! [X0_12] :
( ( mult('#skF_2'(X0_12),X0_12) != '#skF_2'(X0_12) )
| ( mult(X0_12,'#skF_1'(X0_12)) != '#skF_1'(X0_12) ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_1264,plain,
! [A_64] : ( mult(rd(A_64,A_64),'#skF_1'(rd(A_64,A_64))) != '#skF_1'(rd(A_64,A_64)) ),
inference(superposition,[status(thm),theory(equality)],[c_1142,c_12]) ).
tff(c_1279,plain,
! [B_48,A_49] : ( mult(ld(B_48,B_48),'#skF_1'(rd(A_49,A_49))) != '#skF_1'(rd(A_49,A_49)) ),
inference(superposition,[status(thm),theory(equality)],[c_695,c_1264]) ).
tff(c_1285,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_426,c_1279]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP656+1 : TPTP v9.0.0. Released v4.0.0.
% 0.08/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.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 7 22:20:28 EDT 2025
% 0.12/0.34 % CPUTime :
% 4.21/2.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.42/2.11
% 4.42/2.11 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------