TSTP Solution File: GRP001-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP001-2 : 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 : n021.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:32 EDT 2023
% Result : Unsatisfiable 3.04s 1.76s
% Output : CNFRefutation 3.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 29 ( 23 unt; 6 typ; 0 def)
% Number of atoms : 23 ( 22 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 : 4 ( 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 26 (; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > #nlpp > inverse > identity > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
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_77,axiom,
multiply(b,a) != c,
file(unknown,unknown) ).
tff(f_75,axiom,
multiply(a,b) = c,
file(unknown,unknown) ).
tff(f_58,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_74,axiom,
! [X] : ( multiply(X,X) = identity ),
file(unknown,unknown) ).
tff(f_65,axiom,
! [X,Y,Z] : ( multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_70,axiom,
! [X] : ( multiply(X,identity) = X ),
file(unknown,unknown) ).
tff(c_16,plain,
multiply(b,a) != c,
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_14,plain,
multiply(a,b) = c,
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_12,plain,
! [X_8] : ( multiply(X_8,X_8) = identity ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_121,plain,
! [X_14,Y_15,Z_16] : ( multiply(multiply(X_14,Y_15),Z_16) = multiply(X_14,multiply(Y_15,Z_16)) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_158,plain,
! [X_8,Z_16] : ( multiply(X_8,multiply(X_8,Z_16)) = multiply(identity,Z_16) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_121]) ).
tff(c_187,plain,
! [X_17,Z_18] : ( multiply(X_17,multiply(X_17,Z_18)) = Z_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_158]) ).
tff(c_239,plain,
multiply(a,c) = b,
inference(superposition,[status(thm),theory(equality)],[c_14,c_187]) ).
tff(c_8,plain,
! [X_6] : ( multiply(X_6,identity) = X_6 ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_281,plain,
! [X_20,Y_21] : ( multiply(X_20,multiply(Y_21,multiply(X_20,Y_21))) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_121,c_12]) ).
tff(c_183,plain,
! [X_8,Z_16] : ( multiply(X_8,multiply(X_8,Z_16)) = Z_16 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_158]) ).
tff(c_289,plain,
! [Y_21,X_20] : ( multiply(Y_21,multiply(X_20,Y_21)) = multiply(X_20,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_281,c_183]) ).
tff(c_375,plain,
! [Y_22,X_23] : ( multiply(Y_22,multiply(X_23,Y_22)) = X_23 ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_289]) ).
tff(c_408,plain,
multiply(c,b) = a,
inference(superposition,[status(thm),theory(equality)],[c_239,c_375]) ).
tff(c_357,plain,
! [Y_21,X_20] : ( multiply(Y_21,multiply(X_20,Y_21)) = X_20 ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_289]) ).
tff(c_452,plain,
multiply(b,a) = c,
inference(superposition,[status(thm),theory(equality)],[c_408,c_357]) ).
tff(c_462,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_16,c_452]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP001-2 : 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.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 22:07:06 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.04/1.76 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.04/1.76
% 3.04/1.76 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.04/1.79
% 3.04/1.79 Inference rules
% 3.04/1.79 ----------------------
% 3.04/1.79 #Ref : 0
% 3.04/1.79 #Sup : 110
% 3.04/1.79 #Fact : 0
% 3.04/1.79 #Define : 0
% 3.04/1.79 #Split : 0
% 3.04/1.79 #Chain : 0
% 3.04/1.79 #Close : 0
% 3.04/1.79
% 3.04/1.79 Ordering : KBO
% 3.04/1.79
% 3.04/1.79 Simplification rules
% 3.04/1.79 ----------------------
% 3.04/1.79 #Subsume : 0
% 3.04/1.79 #Demod : 77
% 3.04/1.79 #Tautology : 79
% 3.04/1.79 #SimpNegUnit : 1
% 3.04/1.79 #BackRed : 3
% 3.04/1.79
% 3.04/1.79 #Partial instantiations: 0
% 3.04/1.79 #Strategies tried : 1
% 3.04/1.79
% 3.04/1.79 Timing (in seconds)
% 3.04/1.79 ----------------------
% 3.04/1.79 Preprocessing : 0.41
% 3.04/1.79 Parsing : 0.21
% 3.04/1.79 CNF conversion : 0.02
% 3.04/1.79 Main loop : 0.34
% 3.04/1.79 Inferencing : 0.14
% 3.04/1.79 Reduction : 0.11
% 3.04/1.79 Demodulation : 0.09
% 3.04/1.79 BG Simplification : 0.01
% 3.04/1.79 Subsumption : 0.05
% 3.04/1.79 Abstraction : 0.02
% 3.04/1.79 MUC search : 0.00
% 3.04/1.79 Cooper : 0.00
% 3.04/1.79 Total : 0.79
% 3.04/1.79 Index Insertion : 0.00
% 3.04/1.79 Index Deletion : 0.00
% 3.04/1.79 Index Matching : 0.00
% 3.04/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------