TSTP Solution File: GRP006-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP006-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 : n005.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:35 EDT 2023
% Result : Unsatisfiable 2.19s 1.66s
% Output : CNFRefutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 23 ( 13 unt; 5 typ; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 14 ~; 10 |; 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 : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > an_element > #nlpp > inverse > the_element > identity
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(the_element,type,
the_element: $i ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(inverse,type,
inverse: $i > $i ).
tff(identity,type,
identity: $i ).
tff(an_element,type,
an_element: $i > $o ).
tff(f_68,axiom,
an_element(the_element),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X] : product(X,inverse(X),identity),
file(unknown,unknown) ).
tff(f_45,axiom,
! [X,Y,Z] :
( ~ an_element(X)
| ~ an_element(Y)
| ~ product(X,inverse(Y),Z)
| an_element(Z) ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X] : product(identity,X,X),
file(unknown,unknown) ).
tff(f_70,axiom,
~ an_element(inverse(the_element)),
file(unknown,unknown) ).
tff(c_16,plain,
an_element(the_element),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_6,plain,
! [X_3] : product(X_3,inverse(X_3),identity),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_23,plain,
! [Z_24,X_25,Y_26] :
( an_element(Z_24)
| ~ product(X_25,inverse(Y_26),Z_24)
| ~ an_element(Y_26)
| ~ an_element(X_25) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_36,plain,
! [X_3] :
( an_element(identity)
| ~ an_element(X_3) ),
inference(resolution,[status(thm)],[c_6,c_23]) ).
tff(c_38,plain,
! [X_3] : ~ an_element(X_3),
inference(splitLeft,[status(thm)],[c_36]) ).
tff(c_41,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_38,c_16]) ).
tff(c_42,plain,
an_element(identity),
inference(splitRight,[status(thm)],[c_36]) ).
tff(c_2,plain,
! [X_1] : product(identity,X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_37,plain,
! [Y_26] :
( an_element(inverse(Y_26))
| ~ an_element(Y_26)
| ~ an_element(identity) ),
inference(resolution,[status(thm)],[c_2,c_23]) ).
tff(c_58,plain,
! [Y_33] :
( an_element(inverse(Y_33))
| ~ an_element(Y_33) ),
inference(demodulation,[status(thm),theory(equality)],[c_42,c_37]) ).
tff(c_18,plain,
~ an_element(inverse(the_element)),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_61,plain,
~ an_element(the_element),
inference(resolution,[status(thm)],[c_58,c_18]) ).
tff(c_65,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP006-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % 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.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 22:13:56 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.19/1.66 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.19/1.66
% 2.19/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.53/1.70
% 2.53/1.70 Inference rules
% 2.53/1.70 ----------------------
% 2.53/1.70 #Ref : 0
% 2.53/1.70 #Sup : 8
% 2.53/1.70 #Fact : 0
% 2.53/1.70 #Define : 0
% 2.53/1.70 #Split : 1
% 2.53/1.70 #Chain : 0
% 2.53/1.70 #Close : 0
% 2.53/1.70
% 2.53/1.70 Ordering : KBO
% 2.53/1.70
% 2.53/1.70 Simplification rules
% 2.53/1.70 ----------------------
% 2.53/1.70 #Subsume : 2
% 2.53/1.70 #Demod : 2
% 2.53/1.70 #Tautology : 0
% 2.53/1.70 #SimpNegUnit : 2
% 2.53/1.70 #BackRed : 1
% 2.53/1.70
% 2.53/1.70 #Partial instantiations: 0
% 2.53/1.70 #Strategies tried : 1
% 2.53/1.70
% 2.53/1.70 Timing (in seconds)
% 2.53/1.70 ----------------------
% 2.53/1.70 Preprocessing : 0.41
% 2.53/1.70 Parsing : 0.23
% 2.53/1.70 CNF conversion : 0.02
% 2.53/1.70 Main loop : 0.21
% 2.53/1.70 Inferencing : 0.08
% 2.53/1.70 Reduction : 0.05
% 2.53/1.70 Demodulation : 0.04
% 2.53/1.70 BG Simplification : 0.01
% 2.53/1.70 Subsumption : 0.04
% 2.53/1.70 Abstraction : 0.01
% 2.53/1.70 MUC search : 0.00
% 2.53/1.70 Cooper : 0.00
% 2.53/1.70 Total : 0.67
% 2.53/1.70 Index Insertion : 0.00
% 2.53/1.70 Index Deletion : 0.00
% 2.53/1.70 Index Matching : 0.00
% 2.53/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------