TSTP Solution File: GRP163-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP163-1 : 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/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 : n025.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:40:19 EDT 2023
% Result : Unsatisfiable 3.56s 1.98s
% Output : CNFRefutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 20 ( 12 unt; 8 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 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(greatest_lower_bound,type,
greatest_lower_bound: ( $i * $i ) > $i ).
tff(least_upper_bound,type,
least_upper_bound: ( $i * $i ) > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(c,type,
c: $i ).
tff(f_118,axiom,
greatest_lower_bound(a,c) != a,
file(unknown,unknown) ).
tff(f_115,axiom,
greatest_lower_bound(a,b) = a,
file(unknown,unknown) ).
tff(f_116,axiom,
greatest_lower_bound(b,c) = b,
file(unknown,unknown) ).
tff(f_93,axiom,
! [X,Y,Z] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ),
file(unknown,unknown) ).
tff(c_36,plain,
greatest_lower_bound(a,c) != a,
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_32,plain,
greatest_lower_bound(a,b) = a,
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_34,plain,
greatest_lower_bound(b,c) = b,
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_326,plain,
! [X_51,Y_52,Z_53] : ( greatest_lower_bound(greatest_lower_bound(X_51,Y_52),Z_53) = greatest_lower_bound(X_51,greatest_lower_bound(Y_52,Z_53)) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_916,plain,
! [Z_71] : ( greatest_lower_bound(a,greatest_lower_bound(b,Z_71)) = greatest_lower_bound(a,Z_71) ),
inference(superposition,[status(thm),theory(equality)],[c_32,c_326]) ).
tff(c_954,plain,
greatest_lower_bound(a,c) = greatest_lower_bound(a,b),
inference(superposition,[status(thm),theory(equality)],[c_34,c_916]) ).
tff(c_962,plain,
greatest_lower_bound(a,c) = a,
inference(demodulation,[status(thm),theory(equality)],[c_32,c_954]) ).
tff(c_964,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_962]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP163-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.14 % 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.14/0.36 % Computer : n025.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 22:35:35 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.56/1.98 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.56/1.99
% 3.56/1.99 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.96/2.01
% 3.96/2.01 Inference rules
% 3.96/2.01 ----------------------
% 3.96/2.01 #Ref : 0
% 3.96/2.01 #Sup : 245
% 3.96/2.01 #Fact : 0
% 3.96/2.01 #Define : 0
% 3.96/2.01 #Split : 0
% 3.96/2.01 #Chain : 0
% 3.96/2.01 #Close : 0
% 3.96/2.01
% 3.96/2.01 Ordering : KBO
% 3.96/2.01
% 3.96/2.01 Simplification rules
% 3.96/2.01 ----------------------
% 3.96/2.01 #Subsume : 0
% 3.96/2.01 #Demod : 126
% 3.96/2.01 #Tautology : 149
% 3.96/2.01 #SimpNegUnit : 1
% 3.96/2.01 #BackRed : 2
% 3.96/2.01
% 3.96/2.01 #Partial instantiations: 0
% 3.96/2.01 #Strategies tried : 1
% 3.96/2.01
% 3.96/2.01 Timing (in seconds)
% 3.96/2.01 ----------------------
% 3.96/2.02 Preprocessing : 0.46
% 3.96/2.02 Parsing : 0.25
% 3.96/2.02 CNF conversion : 0.02
% 3.96/2.02 Main loop : 0.46
% 3.96/2.02 Inferencing : 0.16
% 3.96/2.02 Reduction : 0.17
% 3.96/2.02 Demodulation : 0.14
% 3.96/2.02 BG Simplification : 0.02
% 3.96/2.02 Subsumption : 0.08
% 3.96/2.02 Abstraction : 0.02
% 3.96/2.02 MUC search : 0.00
% 3.96/2.02 Cooper : 0.00
% 3.96/2.02 Total : 0.96
% 3.96/2.02 Index Insertion : 0.00
% 3.96/2.02 Index Deletion : 0.00
% 3.96/2.02 Index Matching : 0.00
% 3.96/2.02 BG Taut test : 0.00
%------------------------------------------------------------------------------