TSTP Solution File: GRP703-12 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP703-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 : n012.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:58 EDT 2023
% Result : Unsatisfiable 3.33s 1.87s
% Output : CNFRefutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 16
% Syntax : Number of formulae : 26 ( 16 unt; 10 typ; 0 def)
% Number of atoms : 16 ( 15 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 : 17 (; 17 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > x3 > x2 > 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(x3,type,
x3: $i ).
tff(unit,type,
unit: $i ).
tff(op_d,type,
op_d: $i ).
tff(x2,type,
x2: $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_29,axiom,
! [A,B] : ( mult(rd(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [A] : ( mult(unit,A) = A ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [A,B] : ( op_e = mult(mult(rd(op_c,mult(A,B)),B),A) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [A] : ( mult(A,unit) = A ),
file(unknown,unknown) ).
tff(f_51,axiom,
mult(x2,mult(op_e,x3)) != mult(mult(x2,op_e),x3),
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_6,plain,
! [A_5,B_6] : ( mult(rd(A_5,B_6),B_6) = A_5 ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_12,plain,
! [A_10] : ( mult(unit,A_10) = A_10 ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_686,plain,
! [A_53,B_54] : ( mult(mult(rd(op_c,mult(A_53,B_54)),B_54),A_53) = op_e ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_10,plain,
! [A_9] : ( mult(A_9,unit) = A_9 ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_717,plain,
! [B_54] : ( mult(rd(op_c,mult(unit,B_54)),B_54) = op_e ),
inference(superposition,[status(thm),theory(equality)],[c_686,c_10]) ).
tff(c_765,plain,
op_e = op_c,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_12,c_717]) ).
tff(c_28,plain,
mult(mult(x2,op_e),x3) != mult(x2,mult(op_e,x3)),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_773,plain,
mult(mult(x2,op_c),x3) != mult(x2,mult(op_c,x3)),
inference(demodulation,[status(thm),theory(equality)],[c_765,c_765,c_28]) ).
tff(c_776,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_20,c_773]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP703-12 : TPTP v8.1.2. Released v8.1.0.
% 0.07/0.13 % 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.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 22:07:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.33/1.87 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.33/1.87
% 3.33/1.87 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.33/1.90
% 3.33/1.90 Inference rules
% 3.33/1.90 ----------------------
% 3.33/1.90 #Ref : 0
% 3.33/1.90 #Sup : 180
% 3.33/1.90 #Fact : 0
% 3.33/1.90 #Define : 0
% 3.33/1.90 #Split : 0
% 3.33/1.90 #Chain : 0
% 3.33/1.90 #Close : 0
% 3.33/1.90
% 3.33/1.90 Ordering : KBO
% 3.33/1.90
% 3.33/1.90 Simplification rules
% 3.33/1.90 ----------------------
% 3.33/1.90 #Subsume : 3
% 3.33/1.90 #Demod : 71
% 3.33/1.90 #Tautology : 123
% 3.33/1.90 #SimpNegUnit : 0
% 3.33/1.90 #BackRed : 5
% 3.33/1.90
% 3.33/1.90 #Partial instantiations: 0
% 3.33/1.90 #Strategies tried : 1
% 3.33/1.90
% 3.33/1.90 Timing (in seconds)
% 3.33/1.90 ----------------------
% 3.33/1.90 Preprocessing : 0.45
% 3.33/1.90 Parsing : 0.25
% 3.33/1.90 CNF conversion : 0.02
% 3.33/1.90 Main loop : 0.38
% 3.33/1.90 Inferencing : 0.16
% 3.33/1.90 Reduction : 0.12
% 3.33/1.90 Demodulation : 0.09
% 3.33/1.90 BG Simplification : 0.02
% 3.33/1.90 Subsumption : 0.06
% 3.33/1.90 Abstraction : 0.02
% 3.33/1.90 MUC search : 0.00
% 3.33/1.90 Cooper : 0.00
% 3.33/1.90 Total : 0.87
% 3.33/1.90 Index Insertion : 0.00
% 3.33/1.90 Index Deletion : 0.00
% 3.33/1.90 Index Matching : 0.00
% 3.33/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------