TSTP Solution File: GRP665-10 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP665-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 : n014.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:52 EDT 2023
% Result : Unsatisfiable 3.24s 1.91s
% Output : CNFRefutation 3.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 20 ( 13 unt; 7 typ; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > x1 > x0 > unit > op_c
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff(op_c,type,
op_c: $i ).
tff(x1,type,
x1: $i ).
tff(unit,type,
unit: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(x0,type,
x0: $i ).
tff(f_41,axiom,
! [A] : ( mult(op_c,A) = mult(A,op_c) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A,B] : ( ld(A,mult(A,B)) = B ),
file(unknown,unknown) ).
tff(f_39,axiom,
! [A,B,C] : ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) ),
file(unknown,unknown) ).
tff(f_43,axiom,
mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1),
file(unknown,unknown) ).
tff(c_227,plain,
! [A_32] : ( mult(op_c,A_32) = mult(A_32,op_c) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_4,plain,
! [A_3,B_4] : ( ld(A_3,mult(A_3,B_4)) = B_4 ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_249,plain,
! [A_32] : ( ld(op_c,mult(A_32,op_c)) = A_32 ),
inference(superposition,[status(thm),theory(equality)],[c_227,c_4]) ).
tff(c_18,plain,
! [A_17] : ( mult(op_c,A_17) = mult(A_17,op_c) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_716,plain,
! [A_46,C_47,B_48] : ( mult(mult(A_46,C_47),ld(C_47,mult(B_48,C_47))) = mult(mult(A_46,B_48),C_47) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_761,plain,
! [A_17,B_48] : ( mult(mult(op_c,A_17),ld(op_c,mult(B_48,op_c))) = mult(mult(A_17,B_48),op_c) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_716]) ).
tff(c_807,plain,
! [A_17,B_48] : ( mult(mult(op_c,A_17),B_48) = mult(op_c,mult(A_17,B_48)) ),
inference(demodulation,[status(thm),theory(equality)],[c_249,c_18,c_761]) ).
tff(c_20,plain,
mult(mult(op_c,x0),x1) != mult(op_c,mult(x0,x1)),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_1161,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_807,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP665-10 : TPTP v8.1.2. Released v8.1.0.
% 0.00/0.13 % 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.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 21:58:03 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.24/1.91 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.24/1.91
% 3.24/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.66/1.94
% 3.66/1.94 Inference rules
% 3.66/1.94 ----------------------
% 3.66/1.94 #Ref : 0
% 3.66/1.94 #Sup : 279
% 3.66/1.94 #Fact : 0
% 3.66/1.94 #Define : 0
% 3.66/1.94 #Split : 0
% 3.66/1.94 #Chain : 0
% 3.66/1.94 #Close : 0
% 3.66/1.94
% 3.66/1.94 Ordering : KBO
% 3.66/1.94
% 3.66/1.94 Simplification rules
% 3.66/1.94 ----------------------
% 3.66/1.94 #Subsume : 12
% 3.66/1.94 #Demod : 145
% 3.66/1.94 #Tautology : 172
% 3.66/1.94 #SimpNegUnit : 0
% 3.66/1.94 #BackRed : 2
% 3.66/1.94
% 3.66/1.94 #Partial instantiations: 0
% 3.66/1.94 #Strategies tried : 1
% 3.66/1.94
% 3.66/1.94 Timing (in seconds)
% 3.66/1.94 ----------------------
% 3.66/1.94 Preprocessing : 0.41
% 3.66/1.94 Parsing : 0.23
% 3.66/1.94 CNF conversion : 0.02
% 3.66/1.94 Main loop : 0.47
% 3.66/1.94 Inferencing : 0.18
% 3.66/1.94 Reduction : 0.17
% 3.66/1.94 Demodulation : 0.14
% 3.66/1.94 BG Simplification : 0.02
% 3.66/1.94 Subsumption : 0.07
% 3.66/1.94 Abstraction : 0.02
% 3.66/1.94 MUC search : 0.00
% 3.66/1.94 Cooper : 0.00
% 3.66/1.94 Total : 0.93
% 3.66/1.94 Index Insertion : 0.00
% 3.66/1.94 Index Deletion : 0.00
% 3.66/1.94 Index Matching : 0.00
% 3.66/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------