TSTP Solution File: GRP460-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP460-1 : TPTP v8.1.2. Released v2.6.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 : n004.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:18 EDT 2023
% Result : Unsatisfiable 2.56s 1.72s
% Output : CNFRefutation 2.66s
% 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 : 11 (; 11 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > identity > a1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a1,type,
a1: $i ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(identity,type,
identity: $i ).
tff(f_27,axiom,
! [A] : ( inverse(A) = divide(identity,A) ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B] : ( multiply(A,B) = divide(A,divide(identity,B)) ),
file(unknown,unknown) ).
tff(f_29,axiom,
! [A] : ( identity = divide(A,A) ),
file(unknown,unknown) ).
tff(f_31,axiom,
multiply(inverse(a1),a1) != identity,
file(unknown,unknown) ).
tff(c_6,plain,
! [A_6] : ( divide(identity,A_6) = inverse(A_6) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_4,plain,
! [A_4,B_5] : ( divide(A_4,divide(identity,B_5)) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_42,plain,
! [A_10,B_11] : ( divide(A_10,inverse(B_11)) = multiply(A_10,B_11) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_8,plain,
! [A_7] : ( divide(A_7,A_7) = identity ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_53,plain,
! [B_11] : ( multiply(inverse(B_11),B_11) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_42,c_8]) ).
tff(c_10,plain,
multiply(inverse(a1),a1) != identity,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_72,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_53,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP460-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.13 % 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.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 22:14:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.56/1.72 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.66/1.72
% 2.66/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.66/1.75
% 2.66/1.75 Inference rules
% 2.66/1.75 ----------------------
% 2.66/1.75 #Ref : 0
% 2.66/1.75 #Sup : 15
% 2.66/1.75 #Fact : 0
% 2.66/1.75 #Define : 0
% 2.66/1.75 #Split : 0
% 2.66/1.75 #Chain : 0
% 2.66/1.75 #Close : 0
% 2.66/1.75
% 2.66/1.75 Ordering : KBO
% 2.66/1.75
% 2.66/1.75 Simplification rules
% 2.66/1.75 ----------------------
% 2.66/1.75 #Subsume : 0
% 2.66/1.75 #Demod : 6
% 2.66/1.75 #Tautology : 9
% 2.66/1.75 #SimpNegUnit : 0
% 2.66/1.75 #BackRed : 1
% 2.66/1.75
% 2.66/1.75 #Partial instantiations: 0
% 2.66/1.75 #Strategies tried : 1
% 2.66/1.75
% 2.66/1.75 Timing (in seconds)
% 2.66/1.75 ----------------------
% 2.66/1.75 Preprocessing : 0.45
% 2.66/1.75 Parsing : 0.22
% 2.66/1.75 CNF conversion : 0.02
% 2.66/1.75 Main loop : 0.20
% 2.66/1.75 Inferencing : 0.09
% 2.66/1.75 Reduction : 0.06
% 2.66/1.75 Demodulation : 0.04
% 2.66/1.75 BG Simplification : 0.01
% 2.66/1.75 Subsumption : 0.03
% 2.66/1.75 Abstraction : 0.01
% 2.66/1.75 MUC search : 0.00
% 2.66/1.75 Cooper : 0.00
% 2.66/1.75 Total : 0.70
% 2.66/1.75 Index Insertion : 0.00
% 2.66/1.75 Index Deletion : 0.00
% 2.66/1.75 Index Matching : 0.00
% 2.66/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------