TSTP Solution File: GRP010-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP010-4 : 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 : n023.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.78s 1.89s
% Output : CNFRefutation 3.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 22 ( 17 unt; 5 typ; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 17 (; 17 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > #nlpp > inverse > identity > c > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(c,type,
c: $i ).
tff(f_34,axiom,
multiply(b,c) != identity,
file(unknown,unknown) ).
tff(f_29,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_32,axiom,
multiply(c,b) = identity,
file(unknown,unknown) ).
tff(f_26,axiom,
! [X,Y,Z] : ( multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X] : ( multiply(inverse(X),X) = identity ),
file(unknown,unknown) ).
tff(c_10,plain,
multiply(b,c) != identity,
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_4,plain,
! [X_4] : ( multiply(identity,X_4) = X_4 ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_8,plain,
multiply(c,b) = identity,
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_31,plain,
! [X_8,Y_9,Z_10] : ( multiply(multiply(X_8,Y_9),Z_10) = multiply(X_8,multiply(Y_9,Z_10)) ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_52,plain,
! [Z_10] : ( multiply(c,multiply(b,Z_10)) = multiply(identity,Z_10) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_31]) ).
tff(c_59,plain,
! [Z_10] : ( multiply(c,multiply(b,Z_10)) = Z_10 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_52]) ).
tff(c_6,plain,
! [X_5] : ( multiply(inverse(X_5),X_5) = identity ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_46,plain,
! [X_5,Z_10] : ( multiply(inverse(X_5),multiply(X_5,Z_10)) = multiply(identity,Z_10) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_31]) ).
tff(c_73,plain,
! [X_12,Z_13] : ( multiply(inverse(X_12),multiply(X_12,Z_13)) = Z_13 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_46]) ).
tff(c_246,plain,
! [Z_17] : ( multiply(inverse(c),Z_17) = multiply(b,Z_17) ),
inference(superposition,[status(thm),theory(equality)],[c_59,c_73]) ).
tff(c_266,plain,
multiply(b,c) = identity,
inference(superposition,[status(thm),theory(equality)],[c_246,c_6]) ).
tff(c_284,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10,c_266]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP010-4 : TPTP v8.1.2. Released v1.0.0.
% 0.07/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 : n023.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 22:12:07 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.78/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.78/1.90
% 2.78/1.90 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.07/1.93
% 3.07/1.93 Inference rules
% 3.07/1.94 ----------------------
% 3.07/1.94 #Ref : 0
% 3.07/1.94 #Sup : 71
% 3.07/1.94 #Fact : 0
% 3.12/1.94 #Define : 0
% 3.12/1.94 #Split : 0
% 3.12/1.94 #Chain : 0
% 3.12/1.94 #Close : 0
% 3.12/1.94
% 3.12/1.94 Ordering : KBO
% 3.12/1.94
% 3.12/1.94 Simplification rules
% 3.12/1.94 ----------------------
% 3.12/1.94 #Subsume : 0
% 3.12/1.94 #Demod : 34
% 3.12/1.94 #Tautology : 47
% 3.12/1.94 #SimpNegUnit : 1
% 3.12/1.94 #BackRed : 2
% 3.12/1.94
% 3.12/1.94 #Partial instantiations: 0
% 3.12/1.94 #Strategies tried : 1
% 3.12/1.94
% 3.12/1.94 Timing (in seconds)
% 3.12/1.94 ----------------------
% 3.12/1.94 Preprocessing : 0.44
% 3.12/1.94 Parsing : 0.23
% 3.12/1.94 CNF conversion : 0.03
% 3.12/1.94 Main loop : 0.31
% 3.12/1.94 Inferencing : 0.12
% 3.12/1.94 Reduction : 0.10
% 3.12/1.94 Demodulation : 0.07
% 3.12/1.94 BG Simplification : 0.02
% 3.12/1.94 Subsumption : 0.06
% 3.12/1.94 Abstraction : 0.01
% 3.12/1.94 MUC search : 0.00
% 3.12/1.94 Cooper : 0.00
% 3.12/1.94 Total : 0.81
% 3.12/1.94 Index Insertion : 0.00
% 3.12/1.94 Index Deletion : 0.00
% 3.12/1.94 Index Matching : 0.00
% 3.12/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------