TSTP Solution File: BOO011-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : BOO011-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 : n019.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:24 EDT 2023
% Result : Unsatisfiable 2.62s 1.62s
% Output : CNFRefutation 2.62s
% 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(additive_identity) != multiplicative_identity,
file(unknown,unknown) ).
tff(f_45,axiom,
! [X,Y] : ( add(X,Y) = add(Y,X) ),
file(unknown,unknown) ).
tff(f_53,axiom,
! [X] : ( add(X,additive_identity) = X ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [X] : ( add(X,inverse(X)) = multiplicative_identity ),
file(unknown,unknown) ).
tff(c_18,plain,
inverse(additive_identity) != multiplicative_identity,
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_51,plain,
! [Y_19,X_20] : ( add(Y_19,X_20) = add(X_20,Y_19) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_10,plain,
! [X_11] : ( add(X_11,additive_identity) = X_11 ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_98,plain,
! [X_21] : ( add(additive_identity,X_21) = X_21 ),
inference(superposition,[status(thm),theory(equality)],[c_51,c_10]) ).
tff(c_14,plain,
! [X_13] : ( add(X_13,inverse(X_13)) = multiplicative_identity ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_111,plain,
inverse(additive_identity) = multiplicative_identity,
inference(superposition,[status(thm),theory(equality)],[c_98,c_14]) ).
tff(c_139,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_18,c_111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : BOO011-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/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.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 18:35:16 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.62/1.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.62/1.62
% 2.62/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.62/1.65
% 2.62/1.65 Inference rules
% 2.62/1.65 ----------------------
% 2.62/1.65 #Ref : 0
% 2.62/1.65 #Sup : 30
% 2.62/1.65 #Fact : 0
% 2.62/1.65 #Define : 0
% 2.62/1.65 #Split : 0
% 2.62/1.65 #Chain : 0
% 2.62/1.65 #Close : 0
% 2.62/1.65
% 2.62/1.65 Ordering : KBO
% 2.62/1.65
% 2.62/1.65 Simplification rules
% 2.62/1.65 ----------------------
% 2.62/1.65 #Subsume : 0
% 2.62/1.65 #Demod : 2
% 2.62/1.65 #Tautology : 19
% 2.62/1.65 #SimpNegUnit : 1
% 2.62/1.65 #BackRed : 0
% 2.62/1.65
% 2.62/1.65 #Partial instantiations: 0
% 2.62/1.65 #Strategies tried : 1
% 2.62/1.65
% 2.62/1.65 Timing (in seconds)
% 2.62/1.65 ----------------------
% 2.62/1.65 Preprocessing : 0.42
% 2.62/1.65 Parsing : 0.22
% 2.62/1.65 CNF conversion : 0.02
% 2.62/1.65 Main loop : 0.17
% 2.62/1.66 Inferencing : 0.07
% 2.62/1.66 Reduction : 0.05
% 2.62/1.66 Demodulation : 0.04
% 2.62/1.66 BG Simplification : 0.01
% 2.62/1.66 Subsumption : 0.04
% 2.62/1.66 Abstraction : 0.01
% 2.62/1.66 MUC search : 0.00
% 2.62/1.66 Cooper : 0.00
% 2.62/1.66 Total : 0.64
% 2.62/1.66 Index Insertion : 0.00
% 2.62/1.66 Index Deletion : 0.00
% 2.62/1.66 Index Matching : 0.00
% 2.62/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------