TSTP Solution File: GRP042-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP042-2 : TPTP v8.1.2. 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 : n017.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 : Tue Aug 22 10:39:43 EDT 2023
% Result : Unsatisfiable 2.69s 1.68s
% Output : CNFRefutation 2.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 22 ( 8 unt; 7 typ; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 24 ( 13 ~; 11 |; 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 : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > equalish > multiply > #nlpp > inverse > identity > 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(f_100,axiom,
~ equalish(b,a),
file(unknown,unknown) ).
tff(f_98,axiom,
equalish(a,b),
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_18,plain,
~ equalish(b,a),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_16,plain,
equalish(a,b),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_2,plain,
! [X_1] : product(identity,X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_22,plain,
! [W_29,Z_30,Y_31,X_32] :
( product(W_29,Z_30,Y_31)
| ~ product(W_29,Z_30,X_32)
| ~ equalish(X_32,Y_31) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_31,plain,
! [X_1,Y_31] :
( product(identity,X_1,Y_31)
| ~ equalish(X_1,Y_31) ),
inference(resolution,[status(thm)],[c_2,c_22]) ).
tff(c_41,plain,
! [Z_40,W_41,X_42,Y_43] :
( equalish(Z_40,W_41)
| ~ product(X_42,Y_43,W_41)
| ~ product(X_42,Y_43,Z_40) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_57,plain,
! [Z_44,X_45] :
( equalish(Z_44,X_45)
| ~ product(identity,X_45,Z_44) ),
inference(resolution,[status(thm)],[c_2,c_41]) ).
tff(c_84,plain,
! [Y_48,X_49] :
( equalish(Y_48,X_49)
| ~ equalish(X_49,Y_48) ),
inference(resolution,[status(thm)],[c_31,c_57]) ).
tff(c_90,plain,
equalish(b,a),
inference(resolution,[status(thm)],[c_16,c_84]) ).
tff(c_97,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_18,c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP042-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/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.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 21:28:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.69/1.68 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.69/1.68
% 2.69/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.94/1.71
% 2.94/1.71 Inference rules
% 2.94/1.71 ----------------------
% 2.94/1.71 #Ref : 0
% 2.94/1.71 #Sup : 18
% 2.94/1.71 #Fact : 0
% 2.94/1.71 #Define : 0
% 2.94/1.71 #Split : 0
% 2.94/1.71 #Chain : 0
% 2.94/1.71 #Close : 0
% 2.94/1.71
% 2.94/1.71 Ordering : KBO
% 2.94/1.71
% 2.94/1.71 Simplification rules
% 2.94/1.71 ----------------------
% 2.94/1.71 #Subsume : 0
% 2.94/1.71 #Demod : 3
% 2.94/1.71 #Tautology : 3
% 2.94/1.71 #SimpNegUnit : 1
% 2.94/1.71 #BackRed : 0
% 2.94/1.71
% 2.94/1.71 #Partial instantiations: 0
% 2.94/1.71 #Strategies tried : 1
% 2.94/1.71
% 2.94/1.71 Timing (in seconds)
% 2.94/1.71 ----------------------
% 2.94/1.72 Preprocessing : 0.42
% 2.94/1.72 Parsing : 0.23
% 2.94/1.72 CNF conversion : 0.02
% 2.94/1.72 Main loop : 0.24
% 2.94/1.72 Inferencing : 0.10
% 2.94/1.72 Reduction : 0.06
% 2.94/1.72 Demodulation : 0.04
% 2.94/1.72 BG Simplification : 0.02
% 2.94/1.72 Subsumption : 0.05
% 2.94/1.72 Abstraction : 0.01
% 2.94/1.72 MUC search : 0.00
% 2.94/1.72 Cooper : 0.00
% 2.94/1.72 Total : 0.70
% 2.94/1.72 Index Insertion : 0.00
% 2.94/1.72 Index Deletion : 0.00
% 2.94/1.72 Index Matching : 0.00
% 2.94/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------