TSTP Solution File: GRP007-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP007-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 : n012.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:36 EDT 2023
% Result : Unsatisfiable 2.76s 1.65s
% Output : CNFRefutation 2.76s
% 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 : 1 ( 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 : 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.00/0.12 % Problem : GRP007-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.13/0.34 % Computer : n012.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 : Thu Aug 3 22:06:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.76/1.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.76/1.66
% 2.76/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.76/1.68
% 2.76/1.68 Inference rules
% 2.76/1.68 ----------------------
% 2.76/1.68 #Ref : 0
% 2.76/1.68 #Sup : 19
% 2.76/1.68 #Fact : 0
% 2.76/1.68 #Define : 0
% 2.76/1.68 #Split : 0
% 2.76/1.68 #Chain : 0
% 2.76/1.68 #Close : 0
% 2.76/1.68
% 2.76/1.68 Ordering : KBO
% 2.76/1.68
% 2.76/1.68 Simplification rules
% 2.76/1.68 ----------------------
% 2.76/1.68 #Subsume : 0
% 2.76/1.68 #Demod : 0
% 2.76/1.68 #Tautology : 1
% 2.76/1.68 #SimpNegUnit : 1
% 2.76/1.68 #BackRed : 0
% 2.76/1.68
% 2.76/1.68 #Partial instantiations: 0
% 2.76/1.68 #Strategies tried : 1
% 2.76/1.68
% 2.76/1.68 Timing (in seconds)
% 2.76/1.68 ----------------------
% 2.76/1.69 Preprocessing : 0.44
% 2.76/1.69 Parsing : 0.24
% 2.76/1.69 CNF conversion : 0.02
% 2.76/1.69 Main loop : 0.21
% 2.76/1.69 Inferencing : 0.08
% 2.76/1.69 Reduction : 0.06
% 2.76/1.69 Demodulation : 0.04
% 2.76/1.69 BG Simplification : 0.02
% 2.76/1.69 Subsumption : 0.04
% 2.76/1.69 Abstraction : 0.01
% 2.76/1.69 MUC search : 0.00
% 2.76/1.69 Cooper : 0.00
% 2.76/1.69 Total : 0.69
% 2.76/1.69 Index Insertion : 0.00
% 2.76/1.69 Index Deletion : 0.00
% 2.76/1.69 Index Matching : 0.00
% 2.76/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------