TSTP Solution File: GRP679-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP679-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 : n002.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.81s 2.49s
% Output : CNFRefutation 5.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 25 ( 19 unt; 6 typ; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > unit > op_c > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff(a,type,
a: $i ).
tff(op_c,type,
op_c: $i ).
tff(unit,type,
unit: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_38,axiom,
! [A,B,C] : ( mult(A,mult(B,mult(A,C))) = mult(mult(A,mult(B,A)),C) ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [A,B] : ( rd(mult(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [A] : ( mult(op_c,A) = mult(A,op_c) ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [A] : ( mult(unit,A) = A ),
file(unknown,unknown) ).
tff(f_42,axiom,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
file(unknown,unknown) ).
tff(c_520,plain,
! [A_37,B_38,C_39] : ( mult(mult(A_37,mult(B_38,A_37)),C_39) = mult(A_37,mult(B_38,mult(A_37,C_39))) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_8,plain,
! [A_7,B_8] : ( rd(mult(A_7,B_8),B_8) = A_7 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_4792,plain,
! [A_89,B_90,C_91] : ( rd(mult(A_89,mult(B_90,mult(A_89,C_91))),C_91) = mult(A_89,mult(B_90,A_89)) ),
inference(superposition,[status(thm),theory(equality)],[c_520,c_8]) ).
tff(c_225,plain,
! [A_29] : ( mult(op_c,A_29) = mult(A_29,op_c) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_244,plain,
! [A_29] : ( rd(mult(op_c,A_29),op_c) = A_29 ),
inference(superposition,[status(thm),theory(equality)],[c_225,c_8]) ).
tff(c_4803,plain,
! [B_90] : ( mult(op_c,mult(B_90,op_c)) = mult(B_90,mult(op_c,op_c)) ),
inference(superposition,[status(thm),theory(equality)],[c_4792,c_244]) ).
tff(c_16,plain,
! [A_14] : ( mult(op_c,A_14) = mult(A_14,op_c) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_12,plain,
! [A_10] : ( mult(unit,A_10) = A_10 ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_599,plain,
! [A_10,C_39] : ( mult(A_10,mult(unit,mult(A_10,C_39))) = mult(mult(A_10,A_10),C_39) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_520]) ).
tff(c_613,plain,
! [A_10,C_39] : ( mult(mult(A_10,A_10),C_39) = mult(A_10,mult(A_10,C_39)) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_599]) ).
tff(c_18,plain,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_714,plain,
mult(op_c,mult(op_c,a)) != mult(a,mult(op_c,op_c)),
inference(demodulation,[status(thm),theory(equality)],[c_613,c_18]) ).
tff(c_715,plain,
mult(op_c,mult(a,op_c)) != mult(a,mult(op_c,op_c)),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_714]) ).
tff(c_4989,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4803,c_715]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP679-1 : TPTP v8.1.2. Released v4.0.0.
% 0.14/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.36 % Computer : n002.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 22:25:16 EDT 2023
% 0.14/0.36 % CPUTime :
% 5.81/2.49 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.81/2.49
% 5.81/2.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.81/2.52
% 5.81/2.52 Inference rules
% 5.81/2.52 ----------------------
% 5.81/2.52 #Ref : 0
% 5.81/2.52 #Sup : 1177
% 5.81/2.52 #Fact : 0
% 5.81/2.52 #Define : 0
% 5.81/2.52 #Split : 0
% 5.81/2.52 #Chain : 0
% 5.81/2.52 #Close : 0
% 5.81/2.52
% 5.81/2.52 Ordering : KBO
% 5.81/2.52
% 5.81/2.52 Simplification rules
% 5.81/2.52 ----------------------
% 5.81/2.52 #Subsume : 82
% 5.81/2.52 #Demod : 1065
% 5.81/2.52 #Tautology : 555
% 5.81/2.52 #SimpNegUnit : 0
% 5.81/2.52 #BackRed : 5
% 5.81/2.52
% 5.81/2.52 #Partial instantiations: 0
% 5.81/2.52 #Strategies tried : 1
% 5.81/2.52
% 5.81/2.52 Timing (in seconds)
% 5.81/2.52 ----------------------
% 5.81/2.52 Preprocessing : 0.43
% 5.81/2.52 Parsing : 0.24
% 5.81/2.52 CNF conversion : 0.02
% 5.81/2.52 Main loop : 1.02
% 5.81/2.52 Inferencing : 0.37
% 5.81/2.52 Reduction : 0.41
% 5.81/2.52 Demodulation : 0.34
% 5.81/2.52 BG Simplification : 0.04
% 5.81/2.52 Subsumption : 0.15
% 5.81/2.52 Abstraction : 0.06
% 5.81/2.52 MUC search : 0.00
% 5.81/2.52 Cooper : 0.00
% 5.81/2.52 Total : 1.49
% 5.81/2.52 Index Insertion : 0.00
% 5.81/2.52 Index Deletion : 0.00
% 5.81/2.52 Index Matching : 0.00
% 5.81/2.52 BG Taut test : 0.00
%------------------------------------------------------------------------------