TSTP Solution File: GRP001-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP001-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 : n003.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 2.87s 1.82s
% Output : CNFRefutation 3.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 27 ( 22 unt; 5 typ; 0 def)
% Number of atoms : 22 ( 21 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 : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > #nlpp > identity > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $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_36,axiom,
multiply(b,a) != c,
file(unknown,unknown) ).
tff(f_33,axiom,
! [X] : ( multiply(X,X) = identity ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X,Y,Z] : ( multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_34,axiom,
multiply(a,b) = c,
file(unknown,unknown) ).
tff(c_10,plain,
multiply(b,a) != c,
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_6,plain,
! [X_5] : ( multiply(X_5,X_5) = identity ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_4,plain,
! [X_4] : ( multiply(identity,X_4) = X_4 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_41,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_28]) ).
tff(c_60,plain,
! [X_5,Z_10] : ( multiply(X_5,multiply(X_5,Z_10)) = multiply(identity,Z_10) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_41]) ).
tff(c_77,plain,
! [X_11,Z_12] : ( multiply(X_11,multiply(X_11,Z_12)) = Z_12 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_60]) ).
tff(c_110,plain,
! [X_5] : ( multiply(X_5,identity) = X_5 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_77]) ).
tff(c_8,plain,
multiply(a,b) = c,
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_189,plain,
! [Z_14] : ( multiply(a,multiply(b,Z_14)) = multiply(c,Z_14) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_41]) ).
tff(c_213,plain,
multiply(c,b) = multiply(a,identity),
inference(superposition,[status(thm),theory(equality)],[c_6,c_189]) ).
tff(c_218,plain,
multiply(c,b) = a,
inference(demodulation,[status(thm),theory(equality)],[c_110,c_213]) ).
tff(c_219,plain,
! [X_15,Y_16] : ( multiply(X_15,multiply(Y_16,multiply(X_15,Y_16))) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_41]) ).
tff(c_75,plain,
! [X_5,Z_10] : ( multiply(X_5,multiply(X_5,Z_10)) = Z_10 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_60]) ).
tff(c_235,plain,
! [Y_16,X_15] : ( multiply(Y_16,multiply(X_15,Y_16)) = multiply(X_15,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_219,c_75]) ).
tff(c_364,plain,
! [Y_17,X_18] : ( multiply(Y_17,multiply(X_18,Y_17)) = X_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_110,c_235]) ).
tff(c_408,plain,
multiply(b,a) = c,
inference(superposition,[status(thm),theory(equality)],[c_218,c_364]) ).
tff(c_457,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10,c_408]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP001-4 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % 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.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 22:21:54 EDT 2023
% 0.13/0.36 % CPUTime :
% 2.87/1.82 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.05/1.82
% 3.05/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.05/1.85
% 3.05/1.85 Inference rules
% 3.05/1.85 ----------------------
% 3.05/1.85 #Ref : 0
% 3.05/1.85 #Sup : 113
% 3.05/1.85 #Fact : 0
% 3.05/1.85 #Define : 0
% 3.05/1.85 #Split : 0
% 3.05/1.85 #Chain : 0
% 3.05/1.85 #Close : 0
% 3.05/1.85
% 3.05/1.85 Ordering : KBO
% 3.05/1.85
% 3.05/1.85 Simplification rules
% 3.05/1.85 ----------------------
% 3.05/1.85 #Subsume : 0
% 3.05/1.85 #Demod : 73
% 3.05/1.85 #Tautology : 68
% 3.05/1.85 #SimpNegUnit : 1
% 3.05/1.85 #BackRed : 1
% 3.05/1.85
% 3.05/1.85 #Partial instantiations: 0
% 3.05/1.85 #Strategies tried : 1
% 3.05/1.85
% 3.05/1.85 Timing (in seconds)
% 3.05/1.85 ----------------------
% 3.05/1.85 Preprocessing : 0.41
% 3.05/1.85 Parsing : 0.22
% 3.05/1.85 CNF conversion : 0.02
% 3.05/1.85 Main loop : 0.33
% 3.05/1.85 Inferencing : 0.14
% 3.05/1.85 Reduction : 0.11
% 3.05/1.85 Demodulation : 0.08
% 3.05/1.85 BG Simplification : 0.01
% 3.05/1.85 Subsumption : 0.05
% 3.05/1.85 Abstraction : 0.02
% 3.05/1.85 MUC search : 0.00
% 3.05/1.86 Cooper : 0.00
% 3.05/1.86 Total : 0.79
% 3.05/1.86 Index Insertion : 0.00
% 3.05/1.86 Index Deletion : 0.00
% 3.05/1.86 Index Matching : 0.00
% 3.05/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------