TSTP Solution File: GRP162-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP162-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/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 : n003.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.77s 2.14s
% Output : CNFRefutation 3.77s
% 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,
least_upper_bound(a,c) != c,
file(unknown,unknown) ).
tff(f_116,axiom,
least_upper_bound(b,c) = c,
file(unknown,unknown) ).
tff(f_115,axiom,
least_upper_bound(a,b) = b,
file(unknown,unknown) ).
tff(f_95,axiom,
! [X,Y,Z] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ),
file(unknown,unknown) ).
tff(c_36,plain,
least_upper_bound(a,c) != c,
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_34,plain,
least_upper_bound(b,c) = c,
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_32,plain,
least_upper_bound(a,b) = b,
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_391,plain,
! [X_53,Y_54,Z_55] : ( least_upper_bound(least_upper_bound(X_53,Y_54),Z_55) = least_upper_bound(X_53,least_upper_bound(Y_54,Z_55)) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_1139,plain,
! [Z_76] : ( least_upper_bound(a,least_upper_bound(b,Z_76)) = least_upper_bound(b,Z_76) ),
inference(superposition,[status(thm),theory(equality)],[c_32,c_391]) ).
tff(c_1183,plain,
least_upper_bound(b,c) = least_upper_bound(a,c),
inference(superposition,[status(thm),theory(equality)],[c_34,c_1139]) ).
tff(c_1193,plain,
least_upper_bound(a,c) = c,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_1183]) ).
tff(c_1195,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_1193]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GRP162-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.13/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 : n003.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 21:57:38 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.77/2.14 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.77/2.14
% 3.77/2.14 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.77/2.17
% 3.77/2.17 Inference rules
% 3.77/2.17 ----------------------
% 3.77/2.17 #Ref : 0
% 3.77/2.17 #Sup : 301
% 3.77/2.17 #Fact : 0
% 3.77/2.17 #Define : 0
% 3.77/2.17 #Split : 0
% 3.77/2.17 #Chain : 0
% 3.77/2.17 #Close : 0
% 3.77/2.17
% 3.77/2.17 Ordering : KBO
% 3.77/2.17
% 3.77/2.17 Simplification rules
% 3.77/2.17 ----------------------
% 3.77/2.17 #Subsume : 0
% 3.77/2.17 #Demod : 175
% 3.77/2.17 #Tautology : 191
% 3.77/2.17 #SimpNegUnit : 1
% 3.77/2.17 #BackRed : 2
% 3.77/2.17
% 3.77/2.17 #Partial instantiations: 0
% 3.77/2.17 #Strategies tried : 1
% 3.77/2.17
% 3.77/2.17 Timing (in seconds)
% 3.77/2.17 ----------------------
% 3.77/2.17 Preprocessing : 0.48
% 3.77/2.17 Parsing : 0.26
% 3.77/2.17 CNF conversion : 0.02
% 3.77/2.17 Main loop : 0.51
% 3.77/2.17 Inferencing : 0.18
% 3.77/2.17 Reduction : 0.19
% 3.77/2.17 Demodulation : 0.15
% 3.77/2.17 BG Simplification : 0.03
% 3.77/2.17 Subsumption : 0.08
% 3.77/2.17 Abstraction : 0.02
% 3.77/2.17 MUC search : 0.00
% 3.77/2.17 Cooper : 0.00
% 3.77/2.17 Total : 1.04
% 3.77/2.17 Index Insertion : 0.00
% 3.77/2.17 Index Deletion : 0.00
% 3.77/2.17 Index Matching : 0.00
% 3.77/2.17 BG Taut test : 0.00
%------------------------------------------------------------------------------