TSTP Solution File: GRP665-12 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP665-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/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 : 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:52 EDT 2023
% Result : Unsatisfiable 3.20s 1.94s
% Output : CNFRefutation 3.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 19 ( 12 unt; 7 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 16 (; 16 !; 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_31,axiom,
! [A,B] : ( rd(mult(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [A] : ( mult(op_c,A) = mult(A,op_c) ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [A,B,C] : ( mult(A,mult(B,C)) = mult(rd(mult(A,B),A),mult(A,C)) ),
file(unknown,unknown) ).
tff(f_43,axiom,
mult(mult(x0,x1),op_c) != mult(x0,mult(x1,op_c)),
file(unknown,unknown) ).
tff(c_8,plain,
! [A_7,B_8] : ( rd(mult(A_7,B_8),B_8) = A_7 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_18,plain,
! [A_17] : ( mult(op_c,A_17) = mult(A_17,op_c) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_456,plain,
! [A_40,B_41,C_42] : ( mult(rd(mult(A_40,B_41),A_40),mult(A_40,C_42)) = mult(A_40,mult(B_41,C_42)) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_489,plain,
! [A_17,C_42] : ( mult(rd(mult(op_c,A_17),A_17),mult(A_17,C_42)) = mult(A_17,mult(op_c,C_42)) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_456]) ).
tff(c_533,plain,
! [A_17,C_42] : ( mult(op_c,mult(A_17,C_42)) = mult(A_17,mult(op_c,C_42)) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_489]) ).
tff(c_20,plain,
mult(mult(x0,x1),op_c) != mult(x0,mult(x1,op_c)),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_21,plain,
mult(x0,mult(op_c,x1)) != mult(op_c,mult(x0,x1)),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_18,c_20]) ).
tff(c_923,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_533,c_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP665-12 : TPTP v8.1.2. Released v8.1.0.
% 0.07/0.14 % 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.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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:25:52 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.20/1.94 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.20/1.94
% 3.20/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.20/1.96
% 3.20/1.96 Inference rules
% 3.20/1.96 ----------------------
% 3.20/1.96 #Ref : 0
% 3.20/1.96 #Sup : 219
% 3.20/1.96 #Fact : 0
% 3.20/1.96 #Define : 0
% 3.20/1.96 #Split : 0
% 3.20/1.96 #Chain : 0
% 3.20/1.96 #Close : 0
% 3.20/1.96
% 3.20/1.96 Ordering : KBO
% 3.20/1.96
% 3.20/1.96 Simplification rules
% 3.20/1.96 ----------------------
% 3.20/1.96 #Subsume : 8
% 3.20/1.96 #Demod : 115
% 3.20/1.96 #Tautology : 155
% 3.20/1.96 #SimpNegUnit : 0
% 3.20/1.96 #BackRed : 2
% 3.20/1.96
% 3.20/1.96 #Partial instantiations: 0
% 3.20/1.96 #Strategies tried : 1
% 3.20/1.96
% 3.20/1.96 Timing (in seconds)
% 3.20/1.96 ----------------------
% 3.20/1.97 Preprocessing : 0.45
% 3.20/1.97 Parsing : 0.24
% 3.20/1.97 CNF conversion : 0.03
% 3.20/1.97 Main loop : 0.39
% 3.20/1.97 Inferencing : 0.16
% 3.20/1.97 Reduction : 0.13
% 3.20/1.97 Demodulation : 0.11
% 3.20/1.97 BG Simplification : 0.02
% 3.20/1.97 Subsumption : 0.06
% 3.20/1.97 Abstraction : 0.02
% 3.20/1.97 MUC search : 0.00
% 3.20/1.97 Cooper : 0.00
% 3.20/1.97 Total : 0.89
% 3.20/1.97 Index Insertion : 0.00
% 3.20/1.97 Index Deletion : 0.00
% 3.20/1.97 Index Matching : 0.00
% 3.20/1.97 BG Taut test : 0.00
%------------------------------------------------------------------------------