%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP007-1 : TPTP v9.0.0. Released v1.0.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 : n022.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:24:43 PM UTC 2025
% Result : Unsatisfiable 2.90s 1.87s
% Output : CNFRefutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 16 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > multiply > #nlpp > inverse > identity > c
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(identity,type,
identity: $i ).
tff(c,type,
c: $i ).
tff(f_100,axiom,
identity != c,
file(unknown,unknown) ).
tff(f_54,axiom,
! [X] : product(X,identity,X),
file(unknown,unknown) ).
tff(f_96,axiom,
! [A] : product(c,A,A),
file(unknown,unknown) ).
tff(f_70,axiom,
! [X,Y,Z,W] :
( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| ( Z = W ) ),
file(unknown,unknown) ).
tff(c_22,plain,
identity != c,
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_4,plain,
! [X_2] : product(X_2,identity,X_2),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_18,plain,
! [A_23] : product(c,A_23,A_23),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_30,plain,
! [Z_33,W_34,X_35,Y_36] :
( ( Z_33 = W_34 )
| ~ product(X_35,Y_36,W_34)
| ~ product(X_35,Y_36,Z_33) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_74,plain,
! [Z_43,A_44] :
( ( Z_43 = A_44 )
| ~ product(c,A_44,Z_43) ),
inference(resolution,[status(thm)],[c_18,c_30]) ).
tff(c_89,plain,
identity = c,
inference(resolution,[status(thm)],[c_4,c_74]) ).
tff(c_101,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22,c_89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP007-1 : TPTP v9.0.0. Released v1.0.0.
% 0.03/0.13 % 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.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Apr 7 21:09:51 EDT 2025
% 0.13/0.35 % CPUTime :
% 2.90/1.87 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.90/1.87
% 2.90/1.87 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------