TSTP Solution File: GRP531-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP531-1 : TPTP v8.1.2. Released v2.6.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 : n007.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:41:27 EDT 2023
% Result : Unsatisfiable 17.42s 7.29s
% Output : CNFRefutation 17.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 36 unt; 6 typ; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 73 (; 73 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > c3 > b3 > a3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a3,type,
a3: $i ).
tff(c3,type,
c3: $i ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b3,type,
b3: $i ).
tff(f_27,axiom,
! [A,B] : ( inverse(A) = divide(divide(B,B),A) ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B,C] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ),
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C] : ( divide(divide(A,divide(B,C)),divide(A,B)) = C ),
file(unknown,unknown) ).
tff(f_29,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file(unknown,unknown) ).
tff(c_6,plain,
! [B_8,A_7] : ( divide(divide(B_8,B_8),A_7) = inverse(A_7) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_4,plain,
! [A_4,C_6,B_5] : ( divide(A_4,divide(divide(C_6,C_6),B_5)) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_9,plain,
! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_146,plain,
! [A_21,B_22,C_23] : ( divide(divide(A_21,divide(B_22,C_23)),divide(A_21,B_22)) = C_23 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_226,plain,
! [B_24,C_25] : ( inverse(divide(divide(B_24,C_25),B_24)) = C_25 ),
inference(superposition,[status(thm),theory(equality)],[c_146,c_6]) ).
tff(c_264,plain,
! [A_7] : ( inverse(inverse(A_7)) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_226]) ).
tff(c_27,plain,
! [A_11,B_12] : ( divide(A_11,inverse(B_12)) = multiply(A_11,B_12) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_45,plain,
! [B_8,B_12] : ( multiply(divide(B_8,B_8),B_12) = inverse(inverse(B_12)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_27]) ).
tff(c_269,plain,
! [B_8,B_12] : ( multiply(divide(B_8,B_8),B_12) = B_12 ),
inference(demodulation,[status(thm),theory(equality)],[c_264,c_45]) ).
tff(c_162,plain,
! [B_22,C_23] : ( inverse(divide(divide(B_22,C_23),B_22)) = C_23 ),
inference(superposition,[status(thm),theory(equality)],[c_146,c_6]) ).
tff(c_210,plain,
! [B_8,A_7,C_23] : ( divide(divide(divide(B_8,B_8),divide(A_7,C_23)),inverse(A_7)) = C_23 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_146]) ).
tff(c_322,plain,
! [A_29,C_30] : ( multiply(inverse(divide(A_29,C_30)),A_29) = C_30 ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_210]) ).
tff(c_352,plain,
! [C_31,B_32] : ( multiply(C_31,divide(B_32,C_31)) = B_32 ),
inference(superposition,[status(thm),theory(equality)],[c_162,c_322]) ).
tff(c_444,plain,
! [B_35,B_36] : ( divide(B_35,divide(B_36,B_36)) = B_35 ),
inference(superposition,[status(thm),theory(equality)],[c_269,c_352]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(divide(A_1,divide(B_2,C_3)),divide(A_1,B_2)) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_481,plain,
! [B_35,B_36,C_3] : ( divide(divide(B_35,divide(divide(B_36,B_36),C_3)),B_35) = C_3 ),
inference(superposition,[status(thm),theory(equality)],[c_444,c_2]) ).
tff(c_551,plain,
! [B_35,C_3] : ( divide(multiply(B_35,C_3),B_35) = C_3 ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_481]) ).
tff(c_558,plain,
! [B_37,B_38] : ( divide(B_37,divide(B_37,B_38)) = B_38 ),
inference(superposition,[status(thm),theory(equality)],[c_444,c_2]) ).
tff(c_331,plain,
! [C_23,B_22] : ( multiply(C_23,divide(B_22,C_23)) = B_22 ),
inference(superposition,[status(thm),theory(equality)],[c_162,c_322]) ).
tff(c_910,plain,
! [B_43,B_44] : ( multiply(divide(B_43,B_44),B_44) = B_43 ),
inference(superposition,[status(thm),theory(equality)],[c_558,c_331]) ).
tff(c_930,plain,
! [C_3,B_35] : ( multiply(C_3,B_35) = multiply(B_35,C_3) ),
inference(superposition,[status(thm),theory(equality)],[c_551,c_910]) ).
tff(c_343,plain,
! [A_4,B_5] : ( multiply(inverse(multiply(A_4,B_5)),A_4) = inverse(B_5) ),
inference(superposition,[status(thm),theory(equality)],[c_9,c_322]) ).
tff(c_2806,plain,
! [A_77,A_78,B_79] : ( divide(divide(A_77,multiply(A_78,B_79)),divide(A_77,A_78)) = inverse(B_79) ),
inference(superposition,[status(thm),theory(equality)],[c_9,c_146]) ).
tff(c_225,plain,
! [A_7,C_23] : ( multiply(inverse(divide(A_7,C_23)),A_7) = C_23 ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_210]) ).
tff(c_2838,plain,
! [B_79,A_77,A_78] : ( multiply(inverse(inverse(B_79)),divide(A_77,multiply(A_78,B_79))) = divide(A_77,A_78) ),
inference(superposition,[status(thm),theory(equality)],[c_2806,c_225]) ).
tff(c_8644,plain,
! [B_140,A_141,A_142] : ( multiply(B_140,divide(A_141,multiply(A_142,B_140))) = divide(A_141,A_142) ),
inference(demodulation,[status(thm),theory(equality)],[c_264,c_2838]) ).
tff(c_8740,plain,
! [A_4,A_141,B_5] : ( multiply(A_4,divide(A_141,inverse(B_5))) = divide(A_141,inverse(multiply(A_4,B_5))) ),
inference(superposition,[status(thm),theory(equality)],[c_343,c_8644]) ).
tff(c_8863,plain,
! [A_4,A_141,B_5] : ( multiply(A_4,multiply(A_141,B_5)) = multiply(A_141,multiply(A_4,B_5)) ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_9,c_8740]) ).
tff(c_8,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_1184,plain,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(demodulation,[status(thm),theory(equality)],[c_930,c_8]) ).
tff(c_31826,plain,
multiply(a3,multiply(c3,b3)) != multiply(a3,multiply(b3,c3)),
inference(demodulation,[status(thm),theory(equality)],[c_8863,c_1184]) ).
tff(c_31829,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_930,c_31826]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP531-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.15 % 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.15/0.37 % Computer : n007.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 22:09:39 EDT 2023
% 0.15/0.37 % CPUTime :
% 17.42/7.29 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.42/7.30
% 17.42/7.30 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 17.42/7.32
% 17.42/7.32 Inference rules
% 17.42/7.32 ----------------------
% 17.42/7.32 #Ref : 0
% 17.42/7.32 #Sup : 8005
% 17.42/7.32 #Fact : 0
% 17.42/7.32 #Define : 0
% 17.42/7.32 #Split : 0
% 17.42/7.32 #Chain : 0
% 17.42/7.32 #Close : 0
% 17.42/7.32
% 17.42/7.32 Ordering : KBO
% 17.42/7.32
% 17.42/7.33 Simplification rules
% 17.42/7.33 ----------------------
% 17.42/7.33 #Subsume : 823
% 17.42/7.33 #Demod : 13632
% 17.42/7.33 #Tautology : 3812
% 17.42/7.33 #SimpNegUnit : 0
% 17.42/7.33 #BackRed : 26
% 17.42/7.33
% 17.42/7.33 #Partial instantiations: 0
% 17.42/7.33 #Strategies tried : 1
% 17.42/7.33
% 17.42/7.33 Timing (in seconds)
% 17.42/7.33 ----------------------
% 17.42/7.33 Preprocessing : 0.55
% 17.42/7.33 Parsing : 0.30
% 17.42/7.33 CNF conversion : 0.02
% 17.42/7.33 Main loop : 5.44
% 17.42/7.33 Inferencing : 1.29
% 17.42/7.33 Reduction : 3.04
% 17.42/7.33 Demodulation : 2.80
% 17.42/7.33 BG Simplification : 0.15
% 17.42/7.33 Subsumption : 0.65
% 17.42/7.33 Abstraction : 0.30
% 17.42/7.33 MUC search : 0.00
% 17.42/7.33 Cooper : 0.00
% 17.42/7.33 Total : 6.05
% 17.42/7.33 Index Insertion : 0.00
% 17.42/7.33 Index Deletion : 0.00
% 17.42/7.33 Index Matching : 0.00
% 17.42/7.33 BG Taut test : 0.00
%------------------------------------------------------------------------------