TSTP Solution File: GRP682-10 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP682-10 : TPTP v8.1.2. Released v8.1.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 : n020.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:54 EDT 2023
% Result : Unsatisfiable 5.28s 2.26s
% Output : CNFRefutation 5.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 31 ( 25 unt; 6 typ; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 48 (; 48 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > x2 > x1 > x0
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff(x1,type,
x1: $i ).
tff(x2,type,
x2: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(x0,type,
x0: $i ).
tff(f_25,axiom,
! [A] : ( ld(A,mult(A,A)) = A ),
file(unknown,unknown) ).
tff(f_29,axiom,
! [A,B] : ( mult(A,ld(A,B)) = ld(A,mult(A,B)) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [A,B] : ( mult(rd(A,B),B) = rd(mult(A,B),B) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A] : ( rd(mult(A,A),A) = A ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [A,B] : ( ld(A,mult(A,ld(B,B))) = rd(mult(rd(A,A),B),B) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [A,B,C,D] : ( ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D) ),
file(unknown,unknown) ).
tff(f_39,axiom,
ld(ld(x0,x1),mult(ld(x0,x1),x2)) != ld(x0,mult(x0,x2)),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1] : ( ld(A_1,mult(A_1,A_1)) = A_1 ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_6,plain,
! [A_3,B_4] : ( mult(A_3,ld(A_3,B_4)) = ld(A_3,mult(A_3,B_4)) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_48,plain,
! [A_21,B_22] : ( rd(mult(A_21,B_22),B_22) = mult(rd(A_21,B_22),B_22) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_4,plain,
! [A_2] : ( rd(mult(A_2,A_2),A_2) = A_2 ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_55,plain,
! [B_22] : ( mult(rd(B_22,B_22),B_22) = B_22 ),
inference(superposition,[status(thm),theory(equality)],[c_48,c_4]) ).
tff(c_104,plain,
! [A_26,B_27] : ( rd(mult(rd(A_26,A_26),B_27),B_27) = ld(A_26,mult(A_26,ld(B_27,B_27))) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_120,plain,
! [B_22] : ( ld(B_22,mult(B_22,ld(B_22,B_22))) = rd(B_22,B_22) ),
inference(superposition,[status(thm),theory(equality)],[c_55,c_104]) ).
tff(c_135,plain,
! [B_22] : ( rd(B_22,B_22) = ld(B_22,B_22) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_6,c_120]) ).
tff(c_138,plain,
! [B_22] : ( mult(ld(B_22,B_22),B_22) = B_22 ),
inference(demodulation,[status(thm),theory(equality)],[c_135,c_55]) ).
tff(c_201,plain,
! [A_33,B_34,C_35,D_36] : ( ld(ld(A_33,B_34),mult(ld(A_33,B_34),mult(C_35,D_36))) = mult(ld(A_33,mult(A_33,C_35)),D_36) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_255,plain,
! [A_1,C_35,D_36] : ( ld(A_1,mult(ld(A_1,mult(A_1,A_1)),mult(C_35,D_36))) = mult(ld(A_1,mult(A_1,C_35)),D_36) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_201]) ).
tff(c_269,plain,
! [A_1,C_35,D_36] : ( mult(ld(A_1,mult(A_1,C_35)),D_36) = ld(A_1,mult(A_1,mult(C_35,D_36))) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_255]) ).
tff(c_10,plain,
! [A_7,B_8,C_9,D_10] : ( ld(ld(A_7,B_8),mult(ld(A_7,B_8),mult(C_9,D_10))) = mult(ld(A_7,mult(A_7,C_9)),D_10) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_2361,plain,
! [A_94,B_95,C_96,D_97] : ( ld(ld(A_94,B_95),mult(ld(A_94,B_95),mult(C_96,D_97))) = ld(A_94,mult(A_94,mult(C_96,D_97))) ),
inference(demodulation,[status(thm),theory(equality)],[c_269,c_10]) ).
tff(c_2472,plain,
! [A_94,B_95,B_22] : ( ld(ld(A_94,B_95),mult(ld(A_94,B_95),B_22)) = ld(A_94,mult(A_94,mult(ld(B_22,B_22),B_22))) ),
inference(superposition,[status(thm),theory(equality)],[c_138,c_2361]) ).
tff(c_2514,plain,
! [A_94,B_95,B_22] : ( ld(ld(A_94,B_95),mult(ld(A_94,B_95),B_22)) = ld(A_94,mult(A_94,B_22)) ),
inference(demodulation,[status(thm),theory(equality)],[c_138,c_2472]) ).
tff(c_16,plain,
ld(ld(x0,x1),mult(ld(x0,x1),x2)) != ld(x0,mult(x0,x2)),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_3604,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2514,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP682-10 : TPTP v8.1.2. Released v8.1.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 : n020.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 22:01:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 5.28/2.26 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.28/2.26
% 5.28/2.26 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.28/2.29
% 5.28/2.29 Inference rules
% 5.28/2.29 ----------------------
% 5.28/2.29 #Ref : 0
% 5.28/2.29 #Sup : 875
% 5.28/2.29 #Fact : 0
% 5.28/2.29 #Define : 0
% 5.28/2.29 #Split : 0
% 5.28/2.29 #Chain : 0
% 5.28/2.29 #Close : 0
% 5.28/2.29
% 5.28/2.29 Ordering : KBO
% 5.28/2.29
% 5.28/2.29 Simplification rules
% 5.28/2.29 ----------------------
% 5.28/2.29 #Subsume : 0
% 5.28/2.29 #Demod : 1362
% 5.28/2.29 #Tautology : 381
% 5.28/2.29 #SimpNegUnit : 0
% 5.28/2.29 #BackRed : 16
% 5.28/2.29
% 5.28/2.29 #Partial instantiations: 0
% 5.28/2.29 #Strategies tried : 1
% 5.28/2.29
% 5.28/2.29 Timing (in seconds)
% 5.28/2.29 ----------------------
% 5.28/2.29 Preprocessing : 0.40
% 5.28/2.29 Parsing : 0.21
% 5.28/2.29 CNF conversion : 0.02
% 5.28/2.29 Main loop : 0.85
% 5.28/2.29 Inferencing : 0.30
% 5.28/2.29 Reduction : 0.35
% 5.28/2.29 Demodulation : 0.28
% 5.28/2.29 BG Simplification : 0.04
% 5.28/2.29 Subsumption : 0.11
% 5.28/2.29 Abstraction : 0.06
% 5.28/2.29 MUC search : 0.00
% 5.28/2.29 Cooper : 0.00
% 5.28/2.29 Total : 1.30
% 5.28/2.29 Index Insertion : 0.00
% 5.28/2.29 Index Deletion : 0.00
% 5.28/2.29 Index Matching : 0.00
% 5.28/2.29 BG Taut test : 0.00
%------------------------------------------------------------------------------