TSTP Solution File: GRP182-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP182-3 : 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:24 EDT 2023
% Result : Unsatisfiable 2.93s 1.73s
% Output : CNFRefutation 3.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of formulae : 14 ( 8 unt; 6 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > 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(identity,type,
identity: $i ).
tff(f_95,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_107,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_120,axiom,
greatest_lower_bound(identity,least_upper_bound(a,identity)) != identity,
file(unknown,unknown) ).
tff(c_140,plain,
! [Y_44,X_45] : ( least_upper_bound(Y_44,X_45) = least_upper_bound(X_45,Y_44) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_22,plain,
! [X_20,Y_21] : ( greatest_lower_bound(X_20,least_upper_bound(X_20,Y_21)) = X_20 ),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_155,plain,
! [X_45,Y_44] : ( greatest_lower_bound(X_45,least_upper_bound(Y_44,X_45)) = X_45 ),
inference(superposition,[status(thm),theory(equality)],[c_140,c_22]) ).
tff(c_32,plain,
greatest_lower_bound(identity,least_upper_bound(a,identity)) != identity,
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_243,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_155,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP182-3 : 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.15/0.34 % Computer : n025.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Thu Aug 3 22:36:20 EDT 2023
% 0.15/0.34 % CPUTime :
% 2.93/1.73 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.93/1.74
% 2.93/1.74 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.14/1.76
% 3.14/1.76 Inference rules
% 3.14/1.76 ----------------------
% 3.14/1.76 #Ref : 0
% 3.14/1.76 #Sup : 53
% 3.14/1.76 #Fact : 0
% 3.14/1.76 #Define : 0
% 3.14/1.76 #Split : 0
% 3.14/1.76 #Chain : 0
% 3.14/1.76 #Close : 0
% 3.14/1.76
% 3.14/1.76 Ordering : KBO
% 3.14/1.76
% 3.14/1.76 Simplification rules
% 3.14/1.76 ----------------------
% 3.14/1.76 #Subsume : 0
% 3.14/1.76 #Demod : 11
% 3.14/1.76 #Tautology : 36
% 3.14/1.76 #SimpNegUnit : 0
% 3.14/1.76 #BackRed : 1
% 3.14/1.76
% 3.14/1.76 #Partial instantiations: 0
% 3.14/1.76 #Strategies tried : 1
% 3.14/1.76
% 3.14/1.76 Timing (in seconds)
% 3.14/1.76 ----------------------
% 3.14/1.76 Preprocessing : 0.46
% 3.14/1.76 Parsing : 0.24
% 3.14/1.76 CNF conversion : 0.02
% 3.14/1.76 Main loop : 0.26
% 3.14/1.76 Inferencing : 0.09
% 3.14/1.76 Reduction : 0.09
% 3.14/1.76 Demodulation : 0.08
% 3.14/1.76 BG Simplification : 0.02
% 3.14/1.76 Subsumption : 0.05
% 3.14/1.76 Abstraction : 0.01
% 3.14/1.76 MUC search : 0.00
% 3.14/1.77 Cooper : 0.00
% 3.14/1.77 Total : 0.75
% 3.14/1.77 Index Insertion : 0.00
% 3.14/1.77 Index Deletion : 0.00
% 3.14/1.77 Index Matching : 0.00
% 3.14/1.77 BG Taut test : 0.00
%------------------------------------------------------------------------------