TSTP Solution File: GRP704-11 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP704-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/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 : n023.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 20.51s 9.41s
% Output : CNFRefutation 20.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 40 ( 30 unt; 10 typ; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 6 ( 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 : 39 (; 39 !; 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_27,axiom,
! [A,B] : ( ld(A,mult(A,B)) = B ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B] : ( mult(A,ld(A,B)) = B ),
file(unknown,unknown) ).
tff(f_45,axiom,
! [A] : ( op_d = ld(A,mult(op_c,A)) ),
file(unknown,unknown) ).
tff(f_43,axiom,
! [A,B] : ( mult(A,mult(op_c,B)) = mult(mult(A,op_c),B) ),
file(unknown,unknown) ).
tff(f_39,axiom,
! [A,B] : ( mult(op_c,mult(A,B)) = mult(mult(op_c,A),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(x5,op_f)) != mult(mult(x4,x5),op_f),
file(unknown,unknown) ).
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_2,plain,
! [A_1,B_2] : ( mult(A_1,ld(A_1,B_2)) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_72,plain,
! [A_28,B_29] : ( ld(A_28,mult(A_28,B_29)) = B_29 ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_22,plain,
! [A_20] : ( ld(A_20,mult(op_c,A_20)) = op_d ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_79,plain,
op_d = op_c,
inference(superposition,[status(thm),theory(equality)],[c_72,c_22]) ).
tff(c_266,plain,
! [A_40] : ( ld(A_40,mult(op_c,A_40)) = op_c ),
inference(demodulation,[status(thm),theory(equality)],[c_79,c_22]) ).
tff(c_271,plain,
! [A_40] : ( mult(op_c,A_40) = mult(A_40,op_c) ),
inference(superposition,[status(thm),theory(equality)],[c_266,c_2]) ).
tff(c_330,plain,
! [A_43,B_44] : ( mult(mult(A_43,op_c),B_44) = mult(A_43,mult(op_c,B_44)) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_362,plain,
! [A_43,B_2] : ( mult(A_43,mult(op_c,ld(mult(A_43,op_c),B_2))) = B_2 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_330]) ).
tff(c_929,plain,
! [A_58,B_59] : ( mult(mult(op_c,A_58),B_59) = mult(op_c,mult(A_58,B_59)) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_5580,plain,
! [B_116,B_117] : ( mult(op_c,mult(ld(op_c,B_116),B_117)) = mult(B_116,B_117) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_929]) ).
tff(c_5674,plain,
! [B_116,B_2] : ( mult(B_116,mult(op_c,ld(mult(ld(op_c,B_116),op_c),B_2))) = mult(op_c,B_2) ),
inference(superposition,[status(thm),theory(equality)],[c_362,c_5580]) ).
tff(c_27322,plain,
! [B_259,B_260] : ( mult(B_259,mult(op_c,ld(B_259,B_260))) = mult(op_c,B_260) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_271,c_5674]) ).
tff(c_27727,plain,
! [A_3,B_4] : ( mult(op_c,mult(A_3,B_4)) = mult(A_3,mult(op_c,B_4)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_27322]) ).
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,x5),op_f) != mult(x4,mult(x5,op_f)),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_1191,plain,
mult(mult(x4,x5),op_c) != mult(x4,mult(x5,op_c)),
inference(demodulation,[status(thm),theory(equality)],[c_1182,c_1182,c_28]) ).
tff(c_1192,plain,
mult(x4,mult(op_c,x5)) != mult(op_c,mult(x4,x5)),
inference(demodulation,[status(thm),theory(equality)],[c_271,c_271,c_1191]) ).
tff(c_71008,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_27727,c_1192]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GRP704-11 : TPTP v8.1.2. Released v8.1.0.
% 0.13/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.14/0.36 % Computer : n023.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:36:37 EDT 2023
% 0.14/0.36 % CPUTime :
% 20.51/9.41 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.51/9.41
% 20.51/9.41 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 20.62/9.44
% 20.62/9.44 Inference rules
% 20.62/9.44 ----------------------
% 20.62/9.44 #Ref : 0
% 20.62/9.44 #Sup : 16577
% 20.62/9.44 #Fact : 0
% 20.62/9.44 #Define : 0
% 20.62/9.44 #Split : 0
% 20.62/9.44 #Chain : 0
% 20.62/9.44 #Close : 0
% 20.62/9.44
% 20.62/9.44 Ordering : KBO
% 20.62/9.44
% 20.62/9.44 Simplification rules
% 20.62/9.44 ----------------------
% 20.62/9.44 #Subsume : 496
% 20.62/9.44 #Demod : 26925
% 20.62/9.44 #Tautology : 8271
% 20.62/9.44 #SimpNegUnit : 0
% 20.62/9.44 #BackRed : 66
% 20.62/9.44
% 20.62/9.44 #Partial instantiations: 0
% 20.62/9.44 #Strategies tried : 1
% 20.62/9.44
% 20.62/9.44 Timing (in seconds)
% 20.62/9.44 ----------------------
% 20.62/9.44 Preprocessing : 0.44
% 20.62/9.44 Parsing : 0.24
% 20.62/9.44 CNF conversion : 0.02
% 20.62/9.44 Main loop : 7.92
% 20.62/9.44 Inferencing : 1.24
% 20.62/9.44 Reduction : 5.03
% 20.62/9.44 Demodulation : 4.65
% 20.62/9.44 BG Simplification : 0.15
% 20.62/9.44 Subsumption : 1.12
% 20.62/9.44 Abstraction : 0.29
% 20.62/9.44 MUC search : 0.00
% 20.62/9.44 Cooper : 0.00
% 20.62/9.44 Total : 8.41
% 20.62/9.44 Index Insertion : 0.00
% 20.62/9.44 Index Deletion : 0.00
% 20.62/9.44 Index Matching : 0.00
% 20.62/9.44 BG Taut test : 0.00
%------------------------------------------------------------------------------