%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP043-2 : 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 : n003.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:52 PM UTC 2025
% Result : Unsatisfiable 7.27s 2.82s
% Output : CNFRefutation 7.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 19 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 33 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > equalish > multiply > #nlpp > inverse > identity > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(c,type,
c: $i ).
tff(f_101,axiom,
~ equalish(a,c),
file(unknown,unknown) ).
tff(f_98,axiom,
equalish(a,b),
file(unknown,unknown) ).
tff(f_99,axiom,
equalish(b,c),
file(unknown,unknown) ).
tff(f_51,axiom,
! [X] : product(identity,X,X),
file(unknown,unknown) ).
tff(f_95,axiom,
! [X,Y,W,Z] :
( ~ equalish(X,Y)
| ~ product(W,Z,X)
| product(W,Z,Y) ),
file(unknown,unknown) ).
tff(f_65,axiom,
! [X,Y,Z,W] :
( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| equalish(Z,W) ),
file(unknown,unknown) ).
tff(c_20,plain,
~ equalish(a,c),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_16,plain,
equalish(a,b),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_18,plain,
equalish(b,c),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_2,plain,
! [X_1] : product(identity,X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_45,plain,
! [W_36,Z_37,Y_38,X_39] :
( product(W_36,Z_37,Y_38)
| ~ product(W_36,Z_37,X_39)
| ~ equalish(X_39,Y_38) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_56,plain,
! [X_41,Y_42] :
( product(identity,X_41,Y_42)
| ~ equalish(X_41,Y_42) ),
inference(resolution,[status(thm)],[c_2,c_45]) ).
tff(c_14,plain,
! [W_23,Z_24,Y_22,X_21] :
( product(W_23,Z_24,Y_22)
| ~ product(W_23,Z_24,X_21)
| ~ equalish(X_21,Y_22) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_4711,plain,
! [X_227,Y_228,Y_229] :
( product(identity,X_227,Y_228)
| ~ equalish(Y_229,Y_228)
| ~ equalish(X_227,Y_229) ),
inference(resolution,[status(thm)],[c_56,c_14]) ).
tff(c_4992,plain,
! [X_232] :
( product(identity,X_232,c)
| ~ equalish(X_232,b) ),
inference(resolution,[status(thm)],[c_18,c_4711]) ).
tff(c_24,plain,
! [Z_29,W_30,X_31,Y_32] :
( equalish(Z_29,W_30)
| ~ product(X_31,Y_32,W_30)
| ~ product(X_31,Y_32,Z_29) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_33,plain,
! [Z_29,X_1] :
( equalish(Z_29,X_1)
| ~ product(identity,X_1,Z_29) ),
inference(resolution,[status(thm)],[c_2,c_24]) ).
tff(c_5436,plain,
! [X_237] :
( equalish(c,X_237)
| ~ equalish(X_237,b) ),
inference(resolution,[status(thm)],[c_4992,c_33]) ).
tff(c_5505,plain,
equalish(c,a),
inference(resolution,[status(thm)],[c_16,c_5436]) ).
tff(c_65,plain,
! [Y_42,X_41] :
( equalish(Y_42,X_41)
| ~ equalish(X_41,Y_42) ),
inference(resolution,[status(thm)],[c_56,c_33]) ).
tff(c_5511,plain,
equalish(a,c),
inference(resolution,[status(thm)],[c_5505,c_65]) ).
tff(c_5518,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_20,c_5511]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP043-2 : TPTP v9.0.0. Released v1.0.0.
% 0.06/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 : n003.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 21:13:33 EDT 2025
% 0.13/0.34 % CPUTime :
% 7.27/2.82 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.27/2.83
% 7.27/2.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------