%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP023-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/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 : n032.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:46 PM UTC 2025
% Result : Unsatisfiable 2.75s 1.94s
% Output : CNFRefutation 2.89s
% 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 : 2 ( 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 14 ( 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > multiply > #nlpp > inverse > identity
%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(f_95,axiom,
inverse(identity) != identity,
file(unknown,unknown) ).
tff(f_57,axiom,
! [X] : product(X,inverse(X),identity),
file(unknown,unknown) ).
tff(f_51,axiom,
! [X] : product(identity,X,X),
file(unknown,unknown) ).
tff(f_69,axiom,
! [X,Y,Z,W] :
( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| ( Z = W ) ),
file(unknown,unknown) ).
tff(c_18,plain,
inverse(identity) != identity,
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_8,plain,
! [X_4] : product(X_4,inverse(X_4),identity),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_2,plain,
! [X_1] : product(identity,X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_24,plain,
! [Z_29,W_30,X_31,Y_32] :
( ( Z_29 = W_30 )
| ~ product(X_31,Y_32,W_30)
| ~ product(X_31,Y_32,Z_29) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_40,plain,
! [Z_33,X_34] :
( ( Z_33 = X_34 )
| ~ product(identity,X_34,Z_33) ),
inference(resolution,[status(thm)],[c_2,c_24]) ).
tff(c_48,plain,
inverse(identity) = identity,
inference(resolution,[status(thm)],[c_8,c_40]) ).
tff(c_60,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_18,c_48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : GRP023-1 : TPTP v9.0.0. Released v1.0.0.
% 0.00/0.08 % 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.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Mon Apr 7 21:10:30 EDT 2025
% 0.07/0.27 % CPUTime :
% 2.75/1.94 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.75/1.95
% 2.75/1.95 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------