TSTP Solution File: GRP189-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP189-2 : 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:26 EDT 2023
% Result : Unsatisfiable 2.99s 1.76s
% Output : CNFRefutation 3.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 15 ( 8 unt; 7 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 : 3 ( 3 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > 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(f_90,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_102,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_120,axiom,
greatest_lower_bound(b,least_upper_bound(a,b)) != b,
file(unknown,unknown) ).
tff(c_10,plain,
! [Y_9,X_8] : ( least_upper_bound(Y_9,X_8) = least_upper_bound(X_8,Y_9) ),
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_176,plain,
! [X_47,Y_48] : ( greatest_lower_bound(X_47,least_upper_bound(X_47,Y_48)) = X_47 ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_188,plain,
! [X_8,Y_9] : ( greatest_lower_bound(X_8,least_upper_bound(Y_9,X_8)) = X_8 ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_176]) ).
tff(c_38,plain,
greatest_lower_bound(b,least_upper_bound(a,b)) != b,
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_244,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_188,c_38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP189-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.13/0.13 % 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.34 % Computer : n003.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 22:22:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.99/1.76 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.99/1.77
% 2.99/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.12/1.79
% 3.12/1.79 Inference rules
% 3.12/1.79 ----------------------
% 3.12/1.79 #Ref : 0
% 3.12/1.79 #Sup : 51
% 3.12/1.79 #Fact : 0
% 3.12/1.79 #Define : 0
% 3.12/1.79 #Split : 0
% 3.12/1.79 #Chain : 0
% 3.12/1.79 #Close : 0
% 3.12/1.79
% 3.12/1.79 Ordering : KBO
% 3.12/1.79
% 3.12/1.79 Simplification rules
% 3.12/1.79 ----------------------
% 3.12/1.79 #Subsume : 0
% 3.12/1.79 #Demod : 11
% 3.12/1.79 #Tautology : 46
% 3.12/1.79 #SimpNegUnit : 0
% 3.12/1.79 #BackRed : 1
% 3.12/1.79
% 3.12/1.79 #Partial instantiations: 0
% 3.12/1.79 #Strategies tried : 1
% 3.12/1.79
% 3.12/1.79 Timing (in seconds)
% 3.12/1.79 ----------------------
% 3.12/1.79 Preprocessing : 0.48
% 3.12/1.79 Parsing : 0.25
% 3.12/1.79 CNF conversion : 0.02
% 3.12/1.79 Main loop : 0.25
% 3.12/1.79 Inferencing : 0.09
% 3.12/1.79 Reduction : 0.09
% 3.12/1.79 Demodulation : 0.07
% 3.12/1.79 BG Simplification : 0.02
% 3.12/1.79 Subsumption : 0.05
% 3.12/1.79 Abstraction : 0.01
% 3.12/1.79 MUC search : 0.00
% 3.12/1.79 Cooper : 0.00
% 3.12/1.79 Total : 0.77
% 3.12/1.79 Index Insertion : 0.00
% 3.12/1.79 Index Deletion : 0.00
% 3.12/1.79 Index Matching : 0.00
% 3.12/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------