TSTP Solution File: GRP704-12 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP704-12 : 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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n017.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:59 EDT 2023
% Result : Unsatisfiable 3.73s 1.95s
% Output : CNFRefutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 24 ( 14 unt; 10 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 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 : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 15 (; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > x5 > x4 > unit > op_f > op_e > op_d > op_c
%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(x4,type,
x4: $i ).
tff(unit,type,
unit: $i ).
tff(op_d,type,
op_d: $i ).
tff(x5,type,
x5: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_43,axiom,
! [A,B] : ( mult(A,mult(op_c,B)) = mult(mult(A,op_c),B) ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B] : ( mult(A,ld(A,B)) = B ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [A] : ( mult(unit,A) = A ),
file(unknown,unknown) ).
tff(f_49,axiom,
! [A,B] : ( op_f = mult(A,mult(B,ld(mult(A,B),op_c))) ),
file(unknown,unknown) ).
tff(f_51,axiom,
mult(x4,mult(op_f,x5)) != mult(mult(x4,op_f),x5),
file(unknown,unknown) ).
tff(c_20,plain,
! [A_18,B_19] : ( mult(mult(A_18,op_c),B_19) = mult(A_18,mult(op_c,B_19)) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_2,plain,
! [A_1,B_2] : ( mult(A_1,ld(A_1,B_2)) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_12,plain,
! [A_10] : ( mult(unit,A_10) = A_10 ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_1079,plain,
! [A_61,B_62] : ( mult(A_61,mult(B_62,ld(mult(A_61,B_62),op_c))) = op_f ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_1117,plain,
! [B_62] : ( mult(B_62,ld(mult(unit,B_62),op_c)) = op_f ),
inference(superposition,[status(thm),theory(equality)],[c_1079,c_12]) ).
tff(c_1182,plain,
op_f = op_c,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_12,c_1117]) ).
tff(c_28,plain,
mult(mult(x4,op_f),x5) != mult(x4,mult(op_f,x5)),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_1191,plain,
mult(mult(x4,op_c),x5) != mult(x4,mult(op_c,x5)),
inference(demodulation,[status(thm),theory(equality)],[c_1182,c_1182,c_28]) ).
tff(c_1194,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_20,c_1191]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP704-12 : TPTP v8.1.2. Released v8.1.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 21:42:36 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.73/1.95 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.73/1.95
% 3.73/1.95 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.73/1.98
% 3.73/1.98 Inference rules
% 3.73/1.98 ----------------------
% 3.73/1.98 #Ref : 0
% 3.73/1.98 #Sup : 282
% 3.73/1.98 #Fact : 0
% 3.73/1.98 #Define : 0
% 3.73/1.98 #Split : 0
% 3.73/1.98 #Chain : 0
% 3.73/1.98 #Close : 0
% 3.73/1.98
% 3.73/1.98 Ordering : KBO
% 3.73/1.98
% 3.73/1.98 Simplification rules
% 3.73/1.98 ----------------------
% 3.73/1.98 #Subsume : 6
% 3.73/1.98 #Demod : 131
% 3.73/1.98 #Tautology : 178
% 3.73/1.98 #SimpNegUnit : 0
% 3.73/1.98 #BackRed : 6
% 3.73/1.98
% 3.73/1.98 #Partial instantiations: 0
% 3.73/1.98 #Strategies tried : 1
% 3.73/1.98
% 3.73/1.98 Timing (in seconds)
% 3.73/1.98 ----------------------
% 3.73/1.98 Preprocessing : 0.44
% 3.73/1.98 Parsing : 0.24
% 3.73/1.98 CNF conversion : 0.02
% 3.73/1.98 Main loop : 0.48
% 3.73/1.98 Inferencing : 0.19
% 3.73/1.98 Reduction : 0.16
% 3.73/1.98 Demodulation : 0.12
% 3.73/1.98 BG Simplification : 0.02
% 3.73/1.98 Subsumption : 0.08
% 3.73/1.98 Abstraction : 0.02
% 3.73/1.98 MUC search : 0.00
% 3.73/1.98 Cooper : 0.00
% 3.73/1.98 Total : 0.97
% 3.73/1.98 Index Insertion : 0.00
% 3.73/1.98 Index Deletion : 0.00
% 3.73/1.98 Index Matching : 0.00
% 3.73/1.98 BG Taut test : 0.00
%------------------------------------------------------------------------------