TSTP Solution File: GRP019-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP019-1 : 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/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 : 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:38 EDT 2023
% Result : Unsatisfiable 2.71s 1.63s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 16 ( 8 unt; 5 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 : 6 ( 3 >; 3 *; 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 : 17 (; 17 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > multiply > #nlpp > inverse > identity > 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(identity,type,
identity: $i ).
tff(f_60,axiom,
! [X,Y] : product(X,Y,multiply(X,Y)),
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(f_95,axiom,
multiply(identity,a) != a,
file(unknown,unknown) ).
tff(c_10,plain,
! [X_5,Y_6] : product(X_5,Y_6,multiply(X_5,Y_6)),
inference(cnfTransformation,[status(thm)],[f_60]) ).
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_56,plain,
! [Y_6] : ( multiply(identity,Y_6) = Y_6 ),
inference(resolution,[status(thm)],[c_10,c_40]) ).
tff(c_18,plain,
multiply(identity,a) != a,
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_92,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_56,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP019-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/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.16/0.35 % Computer : n017.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu Aug 3 21:37:51 EDT 2023
% 0.16/0.35 % CPUTime :
% 2.71/1.63 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.71/1.63
% 2.71/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.79/1.66
% 2.79/1.66 Inference rules
% 2.79/1.66 ----------------------
% 2.79/1.66 #Ref : 0
% 2.79/1.66 #Sup : 18
% 2.79/1.66 #Fact : 0
% 2.79/1.66 #Define : 0
% 2.79/1.66 #Split : 0
% 2.79/1.66 #Chain : 0
% 2.79/1.66 #Close : 0
% 2.79/1.66
% 2.79/1.66 Ordering : KBO
% 2.79/1.66
% 2.79/1.66 Simplification rules
% 2.79/1.66 ----------------------
% 2.79/1.66 #Subsume : 0
% 2.79/1.66 #Demod : 3
% 2.79/1.66 #Tautology : 6
% 2.79/1.66 #SimpNegUnit : 0
% 2.79/1.66 #BackRed : 1
% 2.79/1.66
% 2.79/1.66 #Partial instantiations: 0
% 2.79/1.66 #Strategies tried : 1
% 2.79/1.66
% 2.79/1.66 Timing (in seconds)
% 2.79/1.67 ----------------------
% 2.79/1.67 Preprocessing : 0.41
% 2.79/1.67 Parsing : 0.23
% 2.79/1.67 CNF conversion : 0.02
% 2.79/1.67 Main loop : 0.19
% 2.79/1.67 Inferencing : 0.08
% 2.79/1.67 Reduction : 0.05
% 2.79/1.67 Demodulation : 0.04
% 2.79/1.67 BG Simplification : 0.01
% 2.79/1.67 Subsumption : 0.04
% 2.79/1.67 Abstraction : 0.01
% 2.79/1.67 MUC search : 0.00
% 2.79/1.67 Cooper : 0.00
% 2.79/1.67 Total : 0.66
% 2.79/1.67 Index Insertion : 0.00
% 2.79/1.67 Index Deletion : 0.00
% 2.79/1.67 Index Matching : 0.00
% 2.79/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------