TSTP Solution File: GRP715+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP715+1 : TPTP v8.1.2. Released v4.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 : n005.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:42:01 EDT 2023
% Result : Theorem 39.24s 24.62s
% Output : CNFRefutation 39.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 56 ( 45 unt; 9 typ; 0 def)
% Number of atoms : 49 ( 47 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 1 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 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 : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 47 (; 47 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ plus > mult > #nlpp > minus > unit > op_b > op_a > op_0 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(op_a,type,
op_a: $i ).
tff(op_0,type,
op_0: $i ).
tff(op_b,type,
op_b: $i ).
tff(plus,type,
plus: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(minus,type,
minus: $i > $i ).
tff(unit,type,
unit: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_42,axiom,
! [A] : ( mult(A,unit) = A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
tff(f_46,axiom,
mult(op_b,op_a) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f11) ).
tff(f_44,axiom,
! [A] : ( mult(unit,A) = A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).
tff(f_45,axiom,
mult(op_a,op_b) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f10) ).
tff(f_40,axiom,
! [B,A] : ( mult(A,mult(B,B)) = mult(mult(A,B),B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
tff(f_38,axiom,
! [C,B,A] : ( mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
tff(f_51,negated_conjecture,
~ ! [X0] :
( ( mult(mult(X0,op_a),op_b) = X0 )
& ( mult(mult(X0,op_b),op_a) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(c_16,plain,
! [A_16] : ( mult(A_16,unit) = A_16 ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_22,plain,
mult(op_b,op_a) = unit,
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_18,plain,
! [A_17] : ( mult(unit,A_17) = A_17 ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_20,plain,
mult(op_a,op_b) = unit,
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_59849,plain,
! [A_307,B_308] : ( mult(mult(A_307,B_308),B_308) = mult(A_307,mult(B_308,B_308)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_59871,plain,
mult(op_a,mult(op_b,op_b)) = mult(unit,op_b),
inference(superposition,[status(thm),theory(equality)],[c_20,c_59849]) ).
tff(c_59888,plain,
mult(op_a,mult(op_b,op_b)) = op_b,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_59871]) ).
tff(c_60629,plain,
! [A_327,B_328,C_329] : ( mult(mult(mult(A_327,B_328),C_329),B_328) = mult(A_327,mult(mult(B_328,C_329),B_328)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_60712,plain,
! [C_329] : ( mult(op_b,mult(mult(op_a,C_329),op_a)) = mult(mult(unit,C_329),op_a) ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_60629]) ).
tff(c_67512,plain,
! [C_389] : ( mult(op_b,mult(mult(op_a,C_389),op_a)) = mult(C_389,op_a) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_60712]) ).
tff(c_67551,plain,
mult(mult(op_b,op_b),op_a) = mult(op_b,mult(op_b,op_a)),
inference(superposition,[status(thm),theory(equality)],[c_59888,c_67512]) ).
tff(c_67566,plain,
mult(mult(op_b,op_b),op_a) = op_b,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_22,c_67551]) ).
tff(c_14,plain,
! [A_15,B_14] : ( mult(mult(A_15,B_14),B_14) = mult(A_15,mult(B_14,B_14)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_60695,plain,
! [C_329] : ( mult(op_a,mult(mult(op_b,C_329),op_b)) = mult(mult(unit,C_329),op_b) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_60629]) ).
tff(c_62865,plain,
! [C_355] : ( mult(op_a,mult(mult(op_b,C_355),op_b)) = mult(C_355,op_b) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_60695]) ).
tff(c_62896,plain,
mult(op_a,mult(op_b,mult(op_b,op_b))) = mult(op_b,op_b),
inference(superposition,[status(thm),theory(equality)],[c_14,c_62865]) ).
tff(c_12,plain,
! [A_13,B_12,C_11] : ( mult(mult(mult(A_13,B_12),C_11),B_12) = mult(A_13,mult(mult(B_12,C_11),B_12)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_78826,plain,
! [A_455,B_456,C_457] : ( mult(mult(A_455,mult(mult(B_456,C_457),B_456)),C_457) = mult(mult(A_455,B_456),mult(mult(C_457,B_456),C_457)) ),
inference(superposition,[status(thm),theory(equality)],[c_60629,c_12]) ).
tff(c_79177,plain,
! [A_455] : ( mult(mult(A_455,op_a),mult(mult(mult(op_b,op_b),op_a),mult(op_b,op_b))) = mult(mult(A_455,mult(op_b,op_a)),mult(op_b,op_b)) ),
inference(superposition,[status(thm),theory(equality)],[c_59888,c_78826]) ).
tff(c_126404,plain,
! [A_595] : ( mult(mult(A_595,op_a),mult(op_b,mult(op_b,op_b))) = mult(A_595,mult(op_b,op_b)) ),
inference(demodulation,[status(thm),theory(equality)],[c_67566,c_16,c_22,c_79177]) ).
tff(c_126537,plain,
! [A_595] : ( mult(A_595,mult(mult(op_a,mult(op_b,mult(op_b,op_b))),op_a)) = mult(mult(A_595,mult(op_b,op_b)),op_a) ),
inference(superposition,[status(thm),theory(equality)],[c_126404,c_12]) ).
tff(c_126658,plain,
! [A_596] : ( mult(mult(A_596,mult(op_b,op_b)),op_a) = mult(A_596,op_b) ),
inference(demodulation,[status(thm),theory(equality)],[c_67566,c_62896,c_126537]) ).
tff(c_126798,plain,
! [A_13] : ( mult(A_13,mult(mult(op_a,mult(op_b,op_b)),op_a)) = mult(mult(A_13,op_a),op_b) ),
inference(superposition,[status(thm),theory(equality)],[c_126658,c_12]) ).
tff(c_126901,plain,
! [A_13] : ( mult(mult(A_13,op_a),op_b) = A_13 ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_22,c_59888,c_126798]) ).
tff(c_388,plain,
! [A_32,B_33] : ( mult(mult(A_32,B_33),B_33) = mult(A_32,mult(B_33,B_33)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_420,plain,
mult(op_b,mult(op_a,op_a)) = mult(unit,op_a),
inference(superposition,[status(thm),theory(equality)],[c_22,c_388]) ).
tff(c_428,plain,
mult(op_b,mult(op_a,op_a)) = op_a,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_420]) ).
tff(c_768,plain,
! [A_43,B_44,C_45] : ( mult(mult(mult(A_43,B_44),C_45),B_44) = mult(A_43,mult(mult(B_44,C_45),B_44)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_17854,plain,
! [A_168,B_169,C_170] : ( mult(mult(A_168,mult(mult(B_169,C_170),B_169)),B_169) = mult(mult(mult(A_168,B_169),C_170),mult(B_169,B_169)) ),
inference(superposition,[status(thm),theory(equality)],[c_768,c_14]) ).
tff(c_18157,plain,
! [A_168] : ( mult(mult(mult(A_168,op_a),op_b),mult(op_a,op_a)) = mult(mult(A_168,mult(unit,op_a)),op_a) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_17854]) ).
tff(c_59284,plain,
! [A_302] : ( mult(mult(mult(A_302,op_a),op_b),mult(op_a,op_a)) = mult(A_302,mult(op_a,op_a)) ),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_18,c_18157]) ).
tff(c_59406,plain,
! [A_302] : ( mult(mult(A_302,op_a),mult(mult(op_b,mult(op_a,op_a)),op_b)) = mult(mult(A_302,mult(op_a,op_a)),op_b) ),
inference(superposition,[status(thm),theory(equality)],[c_59284,c_12]) ).
tff(c_59517,plain,
! [A_303] : ( mult(mult(A_303,mult(op_a,op_a)),op_b) = mult(A_303,op_a) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_20,c_428,c_59406]) ).
tff(c_59652,plain,
! [A_13] : ( mult(A_13,mult(mult(op_b,mult(op_a,op_a)),op_b)) = mult(mult(A_13,op_b),op_a) ),
inference(superposition,[status(thm),theory(equality)],[c_59517,c_12]) ).
tff(c_59751,plain,
! [A_13] : ( mult(mult(A_13,op_b),op_a) = A_13 ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_20,c_428,c_59652]) ).
tff(c_24,plain,
( ( mult(mult('#skF_2',op_a),op_b) != '#skF_2' )
| ( mult(mult('#skF_1',op_b),op_a) != '#skF_1' ) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_177,plain,
mult(mult('#skF_1',op_b),op_a) != '#skF_1',
inference(splitLeft,[status(thm)],[c_24]) ).
tff(c_59771,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_59751,c_177]) ).
tff(c_59772,plain,
mult(mult('#skF_2',op_a),op_b) != '#skF_2',
inference(splitRight,[status(thm)],[c_24]) ).
tff(c_126923,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_126901,c_59772]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP715+1 : TPTP v8.1.2. Released v4.0.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 : n005.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:57:42 EDT 2023
% 0.14/0.35 % CPUTime :
% 39.24/24.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 39.24/24.63
% 39.24/24.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 39.24/24.66
% 39.24/24.66 Inference rules
% 39.24/24.66 ----------------------
% 39.24/24.66 #Ref : 0
% 39.24/24.66 #Sup : 32165
% 39.24/24.66 #Fact : 0
% 39.24/24.66 #Define : 0
% 39.24/24.66 #Split : 1
% 39.24/24.66 #Chain : 0
% 39.24/24.66 #Close : 0
% 39.24/24.66
% 39.24/24.66 Ordering : KBO
% 39.24/24.66
% 39.24/24.66 Simplification rules
% 39.24/24.66 ----------------------
% 39.24/24.66 #Subsume : 2123
% 39.24/24.66 #Demod : 46970
% 39.24/24.66 #Tautology : 10377
% 39.24/24.66 #SimpNegUnit : 0
% 39.24/24.66 #BackRed : 43
% 39.24/24.66
% 39.24/24.66 #Partial instantiations: 0
% 39.24/24.66 #Strategies tried : 1
% 39.24/24.66
% 39.24/24.66 Timing (in seconds)
% 39.24/24.66 ----------------------
% 39.24/24.66 Preprocessing : 0.47
% 39.24/24.66 Parsing : 0.26
% 39.24/24.66 CNF conversion : 0.03
% 39.24/24.66 Main loop : 23.07
% 39.24/24.66 Inferencing : 2.40
% 39.24/24.66 Reduction : 16.68
% 39.24/24.66 Demodulation : 15.91
% 39.24/24.66 BG Simplification : 0.37
% 39.24/24.66 Subsumption : 2.78
% 39.24/24.66 Abstraction : 0.60
% 39.24/24.66 MUC search : 0.00
% 39.24/24.66 Cooper : 0.00
% 39.24/24.66 Total : 23.60
% 39.24/24.66 Index Insertion : 0.00
% 39.24/24.66 Index Deletion : 0.00
% 39.24/24.66 Index Matching : 0.00
% 39.24/24.66 BG Taut test : 0.00
%------------------------------------------------------------------------------