TSTP Solution File: GRP005-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP005-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 : n008.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.59s 1.60s
% Output : CNFRefutation 2.72s
% 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 : 18 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 10 ~; 7 |; 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 : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > an_element > #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(identity,type,
identity: $i ).
tff(an_element,type,
an_element: $i > $o ).
tff(f_72,axiom,
~ an_element(identity),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X] : product(X,inverse(X),identity),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X,Y,Z] :
( ~ an_element(X)
| ~ an_element(Y)
| ~ product(X,inverse(Y),Z)
| an_element(Z) ),
file(unknown,unknown) ).
tff(f_37,axiom,
an_element(a),
file(unknown,unknown) ).
tff(c_18,plain,
~ an_element(identity),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_6,plain,
! [X_3] : product(X_3,inverse(X_3),identity),
inference(cnfTransformation,[status(thm)],[f_34]) ).
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_48]) ).
tff(c_30,plain,
! [X_3] :
( an_element(identity)
| ~ an_element(X_3) ),
inference(resolution,[status(thm)],[c_6,c_23]) ).
tff(c_40,plain,
! [X_3] : ~ an_element(X_3),
inference(negUnitSimplification,[status(thm)],[c_18,c_30]) ).
tff(c_10,plain,
an_element(a),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_44,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_40,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP005-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.17/0.34 % Computer : n008.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu Aug 3 22:02:18 EDT 2023
% 0.17/0.34 % CPUTime :
% 2.59/1.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.59/1.61
% 2.59/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.72/1.64
% 2.72/1.64 Inference rules
% 2.72/1.64 ----------------------
% 2.72/1.64 #Ref : 0
% 2.72/1.64 #Sup : 3
% 2.72/1.64 #Fact : 0
% 2.72/1.64 #Define : 0
% 2.72/1.64 #Split : 0
% 2.72/1.64 #Chain : 0
% 2.72/1.64 #Close : 0
% 2.72/1.64
% 2.72/1.64 Ordering : KBO
% 2.72/1.64
% 2.72/1.64 Simplification rules
% 2.72/1.64 ----------------------
% 2.72/1.64 #Subsume : 3
% 2.72/1.64 #Demod : 0
% 2.72/1.64 #Tautology : 0
% 2.72/1.64 #SimpNegUnit : 4
% 2.72/1.64 #BackRed : 1
% 2.72/1.64
% 2.72/1.64 #Partial instantiations: 0
% 2.72/1.64 #Strategies tried : 1
% 2.72/1.64
% 2.72/1.64 Timing (in seconds)
% 2.72/1.64 ----------------------
% 2.72/1.64 Preprocessing : 0.43
% 2.72/1.64 Parsing : 0.24
% 2.72/1.64 CNF conversion : 0.02
% 2.72/1.64 Main loop : 0.17
% 2.72/1.64 Inferencing : 0.07
% 2.72/1.64 Reduction : 0.04
% 2.86/1.65 Demodulation : 0.03
% 2.86/1.65 BG Simplification : 0.01
% 2.86/1.65 Subsumption : 0.04
% 2.86/1.65 Abstraction : 0.01
% 2.86/1.65 MUC search : 0.00
% 2.86/1.65 Cooper : 0.00
% 2.86/1.65 Total : 0.65
% 2.86/1.65 Index Insertion : 0.00
% 2.86/1.65 Index Deletion : 0.00
% 2.86/1.65 Index Matching : 0.00
% 2.86/1.65 BG Taut test : 0.00
%------------------------------------------------------------------------------