TSTP Solution File: GRP710-11 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP710-11 : 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 : n021.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:00 EDT 2023
% Result : Unsatisfiable 4.05s 2.16s
% Output : CNFRefutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 27 ( 22 unt; 5 typ; 0 def)
% Number of atoms : 22 ( 21 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 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 : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 33 (; 33 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ mult > #nlpp > i > x4 > x3 > unit
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(i,type,
i: $i > $i ).
tff(x3,type,
x3: $i ).
tff(x4,type,
x4: $i ).
tff(unit,type,
unit: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_26,axiom,
! [A] : ( mult(A,unit) = A ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [A] : ( mult(i(A),A) = unit ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [A] : ( mult(unit,A) = A ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [A,B,C] : ( mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C) ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [X5] : ( mult(X5,x4) != x3 ),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1] : ( mult(A_1,unit) = A_1 ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_10,plain,
! [A_7] : ( mult(i(A_7),A_7) = unit ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_4,plain,
! [A_2] : ( mult(unit,A_2) = A_2 ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_92,plain,
! [A_14,B_15,C_16] : ( mult(mult(mult(A_14,B_15),B_15),C_16) = mult(A_14,mult(B_15,mult(B_15,C_16))) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_110,plain,
! [A_14,B_15] : ( mult(A_14,mult(B_15,mult(B_15,unit))) = mult(mult(A_14,B_15),B_15) ),
inference(superposition,[status(thm),theory(equality)],[c_92,c_2]) ).
tff(c_215,plain,
! [A_20,B_21] : ( mult(mult(A_20,B_21),B_21) = mult(A_20,mult(B_21,B_21)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_110]) ).
tff(c_250,plain,
! [A_7] : ( mult(i(A_7),mult(A_7,A_7)) = mult(unit,A_7) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_215]) ).
tff(c_267,plain,
! [A_7] : ( mult(i(A_7),mult(A_7,A_7)) = A_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_250]) ).
tff(c_151,plain,
! [A_14,B_15] : ( mult(mult(A_14,B_15),B_15) = mult(A_14,mult(B_15,B_15)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_110]) ).
tff(c_6,plain,
! [A_3,B_4,C_5] : ( mult(mult(mult(A_3,B_4),B_4),C_5) = mult(A_3,mult(B_4,mult(B_4,C_5))) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_1795,plain,
! [A_66,B_67,C_68] : ( mult(mult(A_66,mult(B_67,B_67)),C_68) = mult(A_66,mult(B_67,mult(B_67,C_68))) ),
inference(demodulation,[status(thm),theory(equality)],[c_151,c_6]) ).
tff(c_12,plain,
! [X5_8] : ( mult(X5_8,x4) != x3 ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_241,plain,
! [A_20] : ( mult(A_20,mult(x4,x4)) != x3 ),
inference(superposition,[status(thm),theory(equality)],[c_215,c_12]) ).
tff(c_2216,plain,
! [A_69,B_70] : ( mult(A_69,mult(B_70,mult(B_70,mult(x4,x4)))) != x3 ),
inference(superposition,[status(thm),theory(equality)],[c_1795,c_241]) ).
tff(c_2252,plain,
! [A_69] : ( mult(A_69,mult(i(x4),x4)) != x3 ),
inference(superposition,[status(thm),theory(equality)],[c_267,c_2216]) ).
tff(c_2284,plain,
! [A_69] : ( x3 != A_69 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_10,c_2252]) ).
tff(c_2292,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_2284]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP710-11 : TPTP v8.1.2. Released v8.1.0.
% 0.00/0.15 % 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.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 21:59:37 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.05/2.16 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.05/2.16
% 4.05/2.16 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.05/2.19
% 4.05/2.19 Inference rules
% 4.05/2.19 ----------------------
% 4.05/2.19 #Ref : 1
% 4.05/2.19 #Sup : 503
% 4.05/2.19 #Fact : 0
% 4.05/2.19 #Define : 0
% 4.05/2.19 #Split : 0
% 4.05/2.19 #Chain : 0
% 4.05/2.19 #Close : 0
% 4.05/2.19
% 4.05/2.19 Ordering : KBO
% 4.05/2.19
% 4.05/2.19 Simplification rules
% 4.05/2.19 ----------------------
% 4.05/2.19 #Subsume : 164
% 4.05/2.19 #Demod : 472
% 4.05/2.19 #Tautology : 131
% 4.05/2.19 #SimpNegUnit : 0
% 4.05/2.19 #BackRed : 6
% 4.05/2.19
% 4.05/2.19 #Partial instantiations: 0
% 4.05/2.19 #Strategies tried : 1
% 4.05/2.19
% 4.05/2.19 Timing (in seconds)
% 4.05/2.19 ----------------------
% 4.05/2.20 Preprocessing : 0.42
% 4.05/2.20 Parsing : 0.21
% 4.05/2.20 CNF conversion : 0.02
% 4.05/2.20 Main loop : 0.72
% 4.05/2.20 Inferencing : 0.28
% 4.05/2.20 Reduction : 0.26
% 4.05/2.20 Demodulation : 0.20
% 4.05/2.20 BG Simplification : 0.03
% 4.05/2.20 Subsumption : 0.12
% 4.05/2.20 Abstraction : 0.03
% 4.05/2.20 MUC search : 0.00
% 4.05/2.20 Cooper : 0.00
% 4.05/2.20 Total : 1.20
% 4.05/2.20 Index Insertion : 0.00
% 4.05/2.20 Index Deletion : 0.00
% 4.05/2.20 Index Matching : 0.00
% 4.05/2.20 BG Taut test : 0.00
%------------------------------------------------------------------------------