TSTP Solution File: GRP023-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP023-2 : TPTP v8.1.2. Released v1.0.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 : n032.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:39:38 EDT 2023
% Result : Unsatisfiable 2.26s 1.59s
% Output : CNFRefutation 2.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 11 ( 8 unt; 3 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 4 (; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > #nlpp > inverse > identity
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(identity,type,
identity: $i ).
tff(f_68,axiom,
inverse(identity) != identity,
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] : ( multiply(X,inverse(X)) = identity ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(c_12,plain,
inverse(identity) != identity,
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_41,plain,
! [X_10] : ( multiply(X_10,inverse(X_10)) = identity ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_47,plain,
inverse(identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_41,c_2]) ).
tff(c_56,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_12,c_47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP023-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.11 % 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.13/0.31 % Computer : n032.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31 % CPULimit : 300
% 0.13/0.31 % WCLimit : 300
% 0.13/0.31 % DateTime : Thu Aug 3 22:09:21 EDT 2023
% 0.13/0.31 % CPUTime :
% 2.26/1.59 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.26/1.59
% 2.26/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.26/1.62
% 2.26/1.62 Inference rules
% 2.26/1.62 ----------------------
% 2.26/1.62 #Ref : 0
% 2.26/1.62 #Sup : 10
% 2.26/1.62 #Fact : 0
% 2.26/1.62 #Define : 0
% 2.26/1.62 #Split : 0
% 2.26/1.62 #Chain : 0
% 2.26/1.62 #Close : 0
% 2.26/1.62
% 2.26/1.62 Ordering : KBO
% 2.26/1.62
% 2.26/1.62 Simplification rules
% 2.26/1.62 ----------------------
% 2.26/1.62 #Subsume : 0
% 2.26/1.62 #Demod : 0
% 2.26/1.62 #Tautology : 7
% 2.26/1.62 #SimpNegUnit : 1
% 2.26/1.62 #BackRed : 0
% 2.26/1.62
% 2.26/1.62 #Partial instantiations: 0
% 2.26/1.62 #Strategies tried : 1
% 2.26/1.62
% 2.26/1.62 Timing (in seconds)
% 2.26/1.62 ----------------------
% 2.47/1.63 Preprocessing : 0.42
% 2.47/1.63 Parsing : 0.22
% 2.47/1.63 CNF conversion : 0.02
% 2.47/1.63 Main loop : 0.12
% 2.47/1.63 Inferencing : 0.05
% 2.47/1.63 Reduction : 0.03
% 2.47/1.63 Demodulation : 0.02
% 2.47/1.63 BG Simplification : 0.01
% 2.47/1.63 Subsumption : 0.03
% 2.47/1.63 Abstraction : 0.00
% 2.47/1.63 MUC search : 0.00
% 2.47/1.63 Cooper : 0.00
% 2.47/1.63 Total : 0.59
% 2.47/1.63 Index Insertion : 0.00
% 2.47/1.63 Index Deletion : 0.00
% 2.47/1.63 Index Matching : 0.00
% 2.47/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------