TSTP Solution File: GRP702+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP702+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:41:58 EDT 2023
% Result : Theorem 9.81s 3.56s
% Output : CNFRefutation 9.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 21
% Syntax : Number of formulae : 50 ( 32 unt; 14 typ; 0 def)
% Number of atoms : 43 ( 40 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 24 ( 17 ~; 5 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-2 aty)
% Number of variables : 35 (; 35 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > unit > op_f > op_e > op_d > op_c > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(op_f,type,
op_f: $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff(op_e,type,
op_e: $i ).
tff(op_c,type,
op_c: $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(unit,type,
unit: $i ).
tff(op_d,type,
op_d: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_44,axiom,
! [B,A] : ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).
tff(f_30,axiom,
! [B,A] : ( ld(A,mult(A,B)) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
tff(f_48,axiom,
! [A] : ( op_d = ld(A,mult(op_c,A)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f11) ).
tff(f_28,axiom,
! [B,A] : ( mult(A,ld(A,B)) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
tff(f_36,axiom,
! [A] : ( mult(A,unit) = A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
tff(f_46,axiom,
! [B,A] : ( mult(A,mult(op_c,B)) = mult(mult(A,op_c),B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f10) ).
tff(f_59,negated_conjecture,
~ ! [X0,X1] :
( ( mult(op_d,mult(X0,X1)) = mult(mult(op_d,X0),X1) )
& ( mult(X0,mult(X1,op_d)) = mult(mult(X0,X1),op_d) )
& ( mult(X0,mult(op_d,X1)) = mult(mult(X0,op_d),X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(c_18,plain,
! [A_17,B_16] : ( mult(mult(A_17,B_16),op_c) = mult(A_17,mult(B_16,op_c)) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_72,plain,
! [A_28,B_29] : ( ld(A_28,mult(A_28,B_29)) = B_29 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_22,plain,
! [A_20] : ( ld(A_20,mult(op_c,A_20)) = op_d ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_79,plain,
op_d = op_c,
inference(superposition,[status(thm),theory(equality)],[c_72,c_22]) ).
tff(c_1188,plain,
! [A_67] : ( ld(A_67,mult(op_c,A_67)) = op_c ),
inference(demodulation,[status(thm),theory(equality)],[c_79,c_22]) ).
tff(c_2,plain,
! [A_2,B_1] : ( mult(A_2,ld(A_2,B_1)) = B_1 ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_1193,plain,
! [A_67] : ( mult(op_c,A_67) = mult(A_67,op_c) ),
inference(superposition,[status(thm),theory(equality)],[c_1188,c_2]) ).
tff(c_10,plain,
! [A_9] : ( mult(A_9,unit) = A_9 ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_1794,plain,
! [A_84,B_85] : ( mult(mult(A_84,op_c),B_85) = mult(A_84,mult(op_c,B_85)) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_16413,plain,
! [A_208,B_209,B_210] : ( mult(mult(A_208,mult(B_209,op_c)),B_210) = mult(mult(A_208,B_209),mult(op_c,B_210)) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_1794]) ).
tff(c_16625,plain,
! [A_208,B_209] : ( mult(mult(A_208,B_209),mult(op_c,unit)) = mult(A_208,mult(B_209,op_c)) ),
inference(superposition,[status(thm),theory(equality)],[c_16413,c_10]) ).
tff(c_16871,plain,
! [A_208,B_209] : ( mult(op_c,mult(A_208,B_209)) = mult(A_208,mult(B_209,op_c)) ),
inference(demodulation,[status(thm),theory(equality)],[c_1193,c_10,c_16625]) ).
tff(c_20,plain,
! [A_19,B_18] : ( mult(mult(A_19,op_c),B_18) = mult(A_19,mult(op_c,B_18)) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_293,plain,
! [A_42] : ( ld(A_42,mult(op_c,A_42)) = op_c ),
inference(demodulation,[status(thm),theory(equality)],[c_79,c_22]) ).
tff(c_301,plain,
! [A_42] : ( mult(op_c,A_42) = mult(A_42,op_c) ),
inference(superposition,[status(thm),theory(equality)],[c_293,c_2]) ).
tff(c_28,plain,
( ( mult(mult(op_d,'#skF_5'),'#skF_6') != mult(op_d,mult('#skF_5','#skF_6')) )
| ( mult(mult('#skF_3','#skF_4'),op_d) != mult('#skF_3',mult('#skF_4',op_d)) )
| ( mult(mult('#skF_1',op_d),'#skF_2') != mult('#skF_1',mult(op_d,'#skF_2')) ) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_136,plain,
( ( mult(mult(op_c,'#skF_5'),'#skF_6') != mult(op_c,mult('#skF_5','#skF_6')) )
| ( mult(mult('#skF_3','#skF_4'),op_c) != mult('#skF_3',mult('#skF_4',op_c)) )
| ( mult(mult('#skF_1',op_c),'#skF_2') != mult('#skF_1',mult(op_c,'#skF_2')) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_79,c_79,c_79,c_79,c_79,c_79,c_28]) ).
tff(c_137,plain,
mult(mult('#skF_1',op_c),'#skF_2') != mult('#skF_1',mult(op_c,'#skF_2')),
inference(splitLeft,[status(thm)],[c_136]) ).
tff(c_368,plain,
mult(mult('#skF_1',op_c),'#skF_2') != mult('#skF_1',mult('#skF_2',op_c)),
inference(demodulation,[status(thm),theory(equality)],[c_301,c_137]) ).
tff(c_1042,plain,
mult('#skF_1',mult(op_c,'#skF_2')) != mult('#skF_1',mult('#skF_2',op_c)),
inference(demodulation,[status(thm),theory(equality)],[c_20,c_368]) ).
tff(c_1045,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_301,c_1042]) ).
tff(c_1046,plain,
( ( mult(mult('#skF_3','#skF_4'),op_c) != mult('#skF_3',mult('#skF_4',op_c)) )
| ( mult(mult(op_c,'#skF_5'),'#skF_6') != mult(op_c,mult('#skF_5','#skF_6')) ) ),
inference(splitRight,[status(thm)],[c_136]) ).
tff(c_1314,plain,
mult(mult(op_c,'#skF_5'),'#skF_6') != mult(op_c,mult('#skF_5','#skF_6')),
inference(splitLeft,[status(thm)],[c_1046]) ).
tff(c_1619,plain,
mult(mult('#skF_5',op_c),'#skF_6') != mult(op_c,mult('#skF_5','#skF_6')),
inference(demodulation,[status(thm),theory(equality)],[c_1193,c_1314]) ).
tff(c_1792,plain,
mult(op_c,mult('#skF_5','#skF_6')) != mult('#skF_5',mult(op_c,'#skF_6')),
inference(demodulation,[status(thm),theory(equality)],[c_20,c_1619]) ).
tff(c_1793,plain,
mult(op_c,mult('#skF_5','#skF_6')) != mult('#skF_5',mult('#skF_6',op_c)),
inference(demodulation,[status(thm),theory(equality)],[c_1193,c_1792]) ).
tff(c_17340,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16871,c_1793]) ).
tff(c_17341,plain,
mult(mult('#skF_3','#skF_4'),op_c) != mult('#skF_3',mult('#skF_4',op_c)),
inference(splitRight,[status(thm)],[c_1046]) ).
tff(c_17423,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_17341]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : GRP702+1 : TPTP v8.1.2. Released v4.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.15/0.37 % Computer : n005.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 21:58:27 EDT 2023
% 0.15/0.37 % CPUTime :
% 9.81/3.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.81/3.57
% 9.81/3.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.81/3.60
% 9.81/3.60 Inference rules
% 9.81/3.60 ----------------------
% 9.81/3.60 #Ref : 0
% 9.81/3.60 #Sup : 4097
% 9.81/3.60 #Fact : 0
% 9.81/3.60 #Define : 0
% 9.81/3.60 #Split : 2
% 9.81/3.60 #Chain : 0
% 9.81/3.60 #Close : 0
% 9.81/3.60
% 9.81/3.60 Ordering : KBO
% 9.81/3.60
% 9.81/3.60 Simplification rules
% 9.81/3.60 ----------------------
% 9.81/3.60 #Subsume : 83
% 9.81/3.60 #Demod : 4760
% 9.81/3.60 #Tautology : 2531
% 9.81/3.60 #SimpNegUnit : 0
% 9.81/3.60 #BackRed : 55
% 9.81/3.60
% 9.81/3.60 #Partial instantiations: 0
% 9.81/3.60 #Strategies tried : 1
% 9.81/3.60
% 9.81/3.60 Timing (in seconds)
% 9.81/3.60 ----------------------
% 9.81/3.60 Preprocessing : 0.47
% 9.81/3.60 Parsing : 0.26
% 9.81/3.60 CNF conversion : 0.03
% 9.81/3.60 Main loop : 2.03
% 9.81/3.60 Inferencing : 0.56
% 9.81/3.60 Reduction : 0.94
% 9.81/3.60 Demodulation : 0.83
% 9.81/3.60 BG Simplification : 0.06
% 9.81/3.60 Subsumption : 0.33
% 9.81/3.60 Abstraction : 0.07
% 9.81/3.60 MUC search : 0.00
% 9.81/3.60 Cooper : 0.00
% 9.81/3.60 Total : 2.56
% 9.81/3.60 Index Insertion : 0.00
% 9.81/3.60 Index Deletion : 0.00
% 9.81/3.60 Index Matching : 0.00
% 9.81/3.60 BG Taut test : 0.00
%------------------------------------------------------------------------------