TSTP Solution File: GRP117-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP117-1 : TPTP v8.1.2. Released v1.2.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 : n017.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:52 EDT 2023
% Result : Unsatisfiable 3.02s 1.82s
% Output : CNFRefutation 3.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 21 unt; 3 typ; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 8 ( 2 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 36 (; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > #nlpp > identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(identity,type,
identity: $i ).
tff(f_23,axiom,
! [X,Y,Z] : ( multiply(X,multiply(multiply(X,multiply(multiply(X,Y),Z)),multiply(identity,multiply(Z,Z)))) = Y ),
file(unknown,unknown) ).
tff(f_25,axiom,
multiply(a,identity) != a,
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] : ( multiply(X_1,multiply(multiply(X_1,multiply(multiply(X_1,Y_2),Z_3)),multiply(identity,multiply(Z_3,Z_3)))) = Y_2 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_5,plain,
! [X_4,Y_5,Z_6] : ( multiply(X_4,multiply(multiply(X_4,multiply(multiply(X_4,Y_5),Z_6)),multiply(identity,multiply(Z_6,Z_6)))) = Y_5 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_42,plain,
! [X_7,Y_8,Y_9] : ( multiply(X_7,multiply(multiply(X_7,multiply(multiply(X_7,Y_8),multiply(identity,multiply(multiply(identity,Y_9),multiply(identity,Y_9))))),Y_9)) = Y_8 ),
inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).
tff(c_107,plain,
! [X_1,Y_2,Y_9] : ( multiply(multiply(X_1,Y_2),multiply(identity,Y_9)) = multiply(X_1,multiply(Y_2,Y_9)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_42]) ).
tff(c_117,plain,
! [X_1,Y_2,Z_3] : ( multiply(X_1,multiply(X_1,multiply(multiply(multiply(X_1,Y_2),Z_3),multiply(Z_3,Z_3)))) = Y_2 ),
inference(demodulation,[status(thm),theory(equality)],[c_107,c_2]) ).
tff(c_135,plain,
! [X_13,Y_14,Z_15] : ( multiply(X_13,multiply(X_13,multiply(multiply(multiply(X_13,Y_14),Z_15),multiply(Z_15,Z_15)))) = Y_14 ),
inference(demodulation,[status(thm),theory(equality)],[c_107,c_2]) ).
tff(c_176,plain,
! [X_13,Y_14] : ( multiply(X_13,multiply(X_13,multiply(multiply(X_13,Y_14),multiply(identity,identity)))) = Y_14 ),
inference(superposition,[status(thm),theory(equality)],[c_107,c_135]) ).
tff(c_239,plain,
! [X_19,Y_20] : ( multiply(X_19,multiply(X_19,multiply(X_19,multiply(Y_20,identity)))) = Y_20 ),
inference(demodulation,[status(thm),theory(equality)],[c_107,c_176]) ).
tff(c_36,plain,
! [X_4,Y_5,Y_2] : ( multiply(X_4,multiply(multiply(X_4,multiply(multiply(X_4,Y_5),multiply(identity,multiply(multiply(identity,Y_2),multiply(identity,Y_2))))),Y_2)) = Y_5 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_5]) ).
tff(c_182,plain,
! [X_4,Y_5,Y_2] : ( multiply(X_4,multiply(multiply(X_4,multiply(X_4,multiply(Y_5,multiply(identity,multiply(Y_2,Y_2))))),Y_2)) = Y_5 ),
inference(demodulation,[status(thm),theory(equality)],[c_107,c_107,c_36]) ).
tff(c_246,plain,
multiply(identity,multiply(multiply(identity,identity),identity)) = identity,
inference(superposition,[status(thm),theory(equality)],[c_239,c_182]) ).
tff(c_181,plain,
! [X_13,Y_14] : ( multiply(X_13,multiply(X_13,multiply(X_13,multiply(Y_14,identity)))) = Y_14 ),
inference(demodulation,[status(thm),theory(equality)],[c_107,c_176]) ).
tff(c_277,plain,
multiply(identity,multiply(identity,identity)) = multiply(identity,identity),
inference(superposition,[status(thm),theory(equality)],[c_246,c_181]) ).
tff(c_299,plain,
! [Z_3] : ( multiply(identity,multiply(identity,multiply(multiply(multiply(identity,identity),Z_3),multiply(Z_3,Z_3)))) = multiply(identity,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_277,c_117]) ).
tff(c_309,plain,
multiply(identity,identity) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_117,c_299]) ).
tff(c_341,plain,
! [X_21] : ( multiply(X_21,multiply(X_21,multiply(X_21,identity))) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_309,c_181]) ).
tff(c_346,plain,
! [X_21] : ( multiply(X_21,identity) = X_21 ),
inference(superposition,[status(thm),theory(equality)],[c_341,c_181]) ).
tff(c_4,plain,
multiply(a,identity) != a,
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_379,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_346,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP117-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/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.14/0.35 % Computer : n017.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 21:37:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.02/1.82 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.02/1.82
% 3.02/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.02/1.86
% 3.02/1.86 Inference rules
% 3.02/1.86 ----------------------
% 3.02/1.86 #Ref : 0
% 3.02/1.86 #Sup : 96
% 3.02/1.86 #Fact : 0
% 3.02/1.86 #Define : 0
% 3.02/1.86 #Split : 0
% 3.02/1.86 #Chain : 0
% 3.02/1.86 #Close : 0
% 3.02/1.86
% 3.02/1.86 Ordering : KBO
% 3.02/1.86
% 3.02/1.86 Simplification rules
% 3.02/1.86 ----------------------
% 3.02/1.86 #Subsume : 0
% 3.02/1.86 #Demod : 46
% 3.02/1.86 #Tautology : 27
% 3.02/1.86 #SimpNegUnit : 0
% 3.02/1.86 #BackRed : 5
% 3.02/1.86
% 3.02/1.86 #Partial instantiations: 0
% 3.02/1.86 #Strategies tried : 1
% 3.02/1.86
% 3.02/1.86 Timing (in seconds)
% 3.02/1.86 ----------------------
% 3.02/1.86 Preprocessing : 0.40
% 3.02/1.86 Parsing : 0.21
% 3.02/1.86 CNF conversion : 0.02
% 3.02/1.86 Main loop : 0.35
% 3.02/1.86 Inferencing : 0.15
% 3.02/1.86 Reduction : 0.10
% 3.02/1.86 Demodulation : 0.08
% 3.02/1.86 BG Simplification : 0.02
% 3.02/1.86 Subsumption : 0.06
% 3.02/1.86 Abstraction : 0.03
% 3.02/1.86 MUC search : 0.00
% 3.02/1.86 Cooper : 0.00
% 3.02/1.86 Total : 0.81
% 3.02/1.86 Index Insertion : 0.00
% 3.02/1.86 Index Deletion : 0.00
% 3.02/1.86 Index Matching : 0.00
% 3.02/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------