TSTP Solution File: BOO018-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : BOO018-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : n024.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 2.67s 1.68s
% Output : CNFRefutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 16 ( 11 unt; 5 typ; 0 def)
% Number of atoms : 11 ( 10 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > add > #nlpp > inverse > multiplicative_identity > additive_identity
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(inverse,type,
inverse: $i > $i ).
tff(additive_identity,type,
additive_identity: $i ).
tff(multiplicative_identity,type,
multiplicative_identity: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(f_63,axiom,
inverse(multiplicative_identity) != additive_identity,
file(unknown,unknown) ).
tff(f_55,axiom,
! [X] : ( multiply(X,multiplicative_identity) = X ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [X,Y] : ( multiply(X,Y) = multiply(Y,X) ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X] : ( multiply(X,inverse(X)) = additive_identity ),
file(unknown,unknown) ).
tff(c_18,plain,
inverse(multiplicative_identity) != additive_identity,
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_12,plain,
! [X_12] : ( multiply(X_12,multiplicative_identity) = X_12 ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_156,plain,
! [Y_22,X_23] : ( multiply(Y_22,X_23) = multiply(X_23,Y_22) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_204,plain,
! [X_24] : ( multiply(multiplicative_identity,X_24) = X_24 ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_156]) ).
tff(c_16,plain,
! [X_14] : ( multiply(X_14,inverse(X_14)) = additive_identity ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_217,plain,
inverse(multiplicative_identity) = additive_identity,
inference(superposition,[status(thm),theory(equality)],[c_204,c_16]) ).
tff(c_245,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_18,c_217]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : BOO018-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.08/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 : n024.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 18:34:45 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.67/1.68 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.67/1.68
% 2.67/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.67/1.70
% 2.67/1.70 Inference rules
% 2.67/1.70 ----------------------
% 2.67/1.70 #Ref : 0
% 2.67/1.70 #Sup : 56
% 2.67/1.70 #Fact : 0
% 2.67/1.70 #Define : 0
% 2.67/1.70 #Split : 0
% 2.67/1.70 #Chain : 0
% 2.67/1.70 #Close : 0
% 2.67/1.70
% 2.67/1.70 Ordering : KBO
% 2.67/1.70
% 2.67/1.70 Simplification rules
% 2.67/1.70 ----------------------
% 2.67/1.70 #Subsume : 0
% 2.67/1.70 #Demod : 10
% 2.67/1.70 #Tautology : 41
% 2.67/1.70 #SimpNegUnit : 1
% 2.67/1.70 #BackRed : 0
% 2.67/1.70
% 2.67/1.70 #Partial instantiations: 0
% 2.67/1.70 #Strategies tried : 1
% 2.67/1.70
% 2.67/1.70 Timing (in seconds)
% 2.67/1.70 ----------------------
% 2.67/1.71 Preprocessing : 0.42
% 2.67/1.71 Parsing : 0.22
% 2.67/1.71 CNF conversion : 0.02
% 2.67/1.71 Main loop : 0.22
% 2.67/1.71 Inferencing : 0.08
% 2.67/1.71 Reduction : 0.07
% 2.67/1.71 Demodulation : 0.06
% 2.67/1.71 BG Simplification : 0.01
% 2.67/1.71 Subsumption : 0.04
% 2.67/1.71 Abstraction : 0.01
% 2.67/1.71 MUC search : 0.00
% 2.67/1.71 Cooper : 0.00
% 2.67/1.71 Total : 0.68
% 2.67/1.71 Index Insertion : 0.00
% 2.67/1.71 Index Deletion : 0.00
% 2.67/1.71 Index Matching : 0.00
% 2.67/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------