TSTP Solution File: BOO021-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : BOO021-1 : TPTP v8.1.2. Released v2.2.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:34:27 EDT 2023
% Result : Unsatisfiable 3.23s 1.89s
% Output : CNFRefutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% 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 : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 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 : 19 (; 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > add > #nlpp > inverse > n1 > n0 > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(n1,type,
n1: $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(n0,type,
n0: $i ).
tff(f_26,axiom,
! [X,Y] : ( multiply(add(X,Y),Y) = Y ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X,Y] : ( add(multiply(X,Y),Y) = Y ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X,Y,Z] : ( multiply(X,add(Y,Z)) = add(multiply(Y,X),multiply(Z,X)) ),
file(unknown,unknown) ).
tff(f_39,axiom,
multiply(b,a) != multiply(a,b),
file(unknown,unknown) ).
tff(c_41,plain,
! [X_17,Y_18] : ( multiply(add(X_17,Y_18),Y_18) = Y_18 ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_8,plain,
! [X_7,Y_8] : ( add(multiply(X_7,Y_8),Y_8) = Y_8 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_47,plain,
! [Y_18] : ( add(Y_18,Y_18) = Y_18 ),
inference(superposition,[status(thm),theory(equality)],[c_41,c_8]) ).
tff(c_127,plain,
! [Y_24,X_25,Z_26] : ( add(multiply(Y_24,X_25),multiply(Z_26,X_25)) = multiply(X_25,add(Y_24,Z_26)) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_134,plain,
! [X_25,Z_26] : ( multiply(X_25,add(Z_26,Z_26)) = multiply(Z_26,X_25) ),
inference(superposition,[status(thm),theory(equality)],[c_127,c_47]) ).
tff(c_176,plain,
! [Z_26,X_25] : ( multiply(Z_26,X_25) = multiply(X_25,Z_26) ),
inference(demodulation,[status(thm),theory(equality)],[c_47,c_134]) ).
tff(c_14,plain,
multiply(b,a) != multiply(a,b),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_604,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_176,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : BOO021-1 : TPTP v8.1.2. Released v2.2.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.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 18:30:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.23/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.23/1.89
% 3.23/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.33/1.92
% 3.33/1.92 Inference rules
% 3.33/1.92 ----------------------
% 3.33/1.92 #Ref : 0
% 3.33/1.92 #Sup : 164
% 3.33/1.92 #Fact : 0
% 3.33/1.92 #Define : 0
% 3.33/1.92 #Split : 0
% 3.33/1.92 #Chain : 0
% 3.33/1.92 #Close : 0
% 3.33/1.92
% 3.33/1.92 Ordering : KBO
% 3.33/1.92
% 3.33/1.92 Simplification rules
% 3.33/1.92 ----------------------
% 3.33/1.92 #Subsume : 0
% 3.33/1.92 #Demod : 53
% 3.33/1.92 #Tautology : 78
% 3.33/1.92 #SimpNegUnit : 0
% 3.33/1.92 #BackRed : 1
% 3.33/1.92
% 3.33/1.92 #Partial instantiations: 0
% 3.33/1.92 #Strategies tried : 1
% 3.33/1.92
% 3.33/1.92 Timing (in seconds)
% 3.33/1.92 ----------------------
% 3.33/1.92 Preprocessing : 0.42
% 3.33/1.92 Parsing : 0.22
% 3.33/1.92 CNF conversion : 0.02
% 3.33/1.92 Main loop : 0.38
% 3.33/1.92 Inferencing : 0.15
% 3.33/1.92 Reduction : 0.12
% 3.33/1.92 Demodulation : 0.09
% 3.33/1.92 BG Simplification : 0.02
% 3.33/1.92 Subsumption : 0.07
% 3.33/1.92 Abstraction : 0.02
% 3.33/1.92 MUC search : 0.00
% 3.33/1.92 Cooper : 0.00
% 3.33/1.92 Total : 0.85
% 3.33/1.92 Index Insertion : 0.00
% 3.33/1.92 Index Deletion : 0.00
% 3.33/1.92 Index Matching : 0.00
% 3.33/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------