TSTP Solution File: GRP703-10 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP703-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/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 : n027.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 6.71s 2.73s
% Output : CNFRefutation 7.01s
% 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_39,axiom,
! [A,B] : ( mult(op_c,mult(A,B)) = mult(mult(op_c,A),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(op_e,mult(x2,x3)) != mult(mult(op_e,x2),x3),
file(unknown,unknown) ).
tff(c_16,plain,
! [A_14,B_15] : ( mult(mult(op_c,A_14),B_15) = mult(op_c,mult(A_14,B_15)) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
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(op_e,x2),x3) != mult(op_e,mult(x2,x3)),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_773,plain,
mult(mult(op_c,x2),x3) != mult(op_c,mult(x2,x3)),
inference(demodulation,[status(thm),theory(equality)],[c_765,c_765,c_28]) ).
tff(c_10115,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_773]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP703-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/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 : n027.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.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 22:45:24 EDT 2023
% 0.14/0.35 % CPUTime :
% 6.71/2.73 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.71/2.73
% 6.71/2.73 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.01/2.76
% 7.01/2.76 Inference rules
% 7.01/2.76 ----------------------
% 7.01/2.76 #Ref : 0
% 7.01/2.76 #Sup : 2370
% 7.01/2.76 #Fact : 0
% 7.01/2.76 #Define : 0
% 7.01/2.76 #Split : 0
% 7.01/2.76 #Chain : 0
% 7.01/2.76 #Close : 0
% 7.01/2.76
% 7.01/2.76 Ordering : KBO
% 7.01/2.76
% 7.01/2.76 Simplification rules
% 7.01/2.76 ----------------------
% 7.01/2.76 #Subsume : 43
% 7.01/2.76 #Demod : 2757
% 7.01/2.76 #Tautology : 1490
% 7.01/2.76 #SimpNegUnit : 0
% 7.01/2.76 #BackRed : 20
% 7.01/2.76
% 7.01/2.76 #Partial instantiations: 0
% 7.01/2.76 #Strategies tried : 1
% 7.01/2.76
% 7.01/2.76 Timing (in seconds)
% 7.01/2.76 ----------------------
% 7.01/2.77 Preprocessing : 0.45
% 7.01/2.77 Parsing : 0.25
% 7.01/2.77 CNF conversion : 0.02
% 7.01/2.77 Main loop : 1.25
% 7.01/2.77 Inferencing : 0.40
% 7.01/2.77 Reduction : 0.53
% 7.01/2.77 Demodulation : 0.45
% 7.01/2.77 BG Simplification : 0.05
% 7.01/2.77 Subsumption : 0.20
% 7.01/2.77 Abstraction : 0.05
% 7.01/2.77 MUC search : 0.00
% 7.01/2.77 Cooper : 0.00
% 7.01/2.77 Total : 1.76
% 7.01/2.77 Index Insertion : 0.00
% 7.01/2.77 Index Deletion : 0.00
% 7.01/2.77 Index Matching : 0.00
% 7.01/2.77 BG Taut test : 0.00
%------------------------------------------------------------------------------