TSTP Solution File: GRP150-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP150-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 : n017.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:18 EDT 2023
% Result : Unsatisfiable 3.56s 1.88s
% Output : CNFRefutation 3.56s
% 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 : 4 ( 3 avg)
% Maximal term depth : 3 ( 2 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_97,axiom,
! [X] : ( least_upper_bound(X,X) = X ),
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(f_116,axiom,
least_upper_bound(a,least_upper_bound(a,b)) != least_upper_bound(a,b),
file(unknown,unknown) ).
tff(c_16,plain,
! [X_16] : ( least_upper_bound(X_16,X_16) = X_16 ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_712,plain,
! [X_63,Y_64,Z_65] : ( least_upper_bound(least_upper_bound(X_63,Y_64),Z_65) = least_upper_bound(X_63,least_upper_bound(Y_64,Z_65)) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_805,plain,
! [X_16,Z_65] : ( least_upper_bound(X_16,least_upper_bound(X_16,Z_65)) = least_upper_bound(X_16,Z_65) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_712]) ).
tff(c_32,plain,
least_upper_bound(a,least_upper_bound(a,b)) != least_upper_bound(a,b),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_822,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_805,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP150-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 : n017.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:47:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.56/1.88 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.56/1.88
% 3.56/1.88 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.56/1.91
% 3.56/1.91 Inference rules
% 3.56/1.91 ----------------------
% 3.56/1.91 #Ref : 0
% 3.56/1.91 #Sup : 201
% 3.56/1.91 #Fact : 0
% 3.56/1.91 #Define : 0
% 3.56/1.91 #Split : 0
% 3.56/1.91 #Chain : 0
% 3.56/1.91 #Close : 0
% 3.56/1.91
% 3.56/1.91 Ordering : KBO
% 3.56/1.91
% 3.56/1.91 Simplification rules
% 3.56/1.91 ----------------------
% 3.56/1.91 #Subsume : 0
% 3.56/1.91 #Demod : 131
% 3.56/1.91 #Tautology : 113
% 3.56/1.91 #SimpNegUnit : 0
% 3.56/1.91 #BackRed : 1
% 3.56/1.91
% 3.56/1.91 #Partial instantiations: 0
% 3.56/1.91 #Strategies tried : 1
% 3.56/1.91
% 3.56/1.91 Timing (in seconds)
% 3.56/1.91 ----------------------
% 3.56/1.91 Preprocessing : 0.44
% 3.56/1.91 Parsing : 0.24
% 3.56/1.91 CNF conversion : 0.02
% 3.56/1.91 Main loop : 0.40
% 3.56/1.91 Inferencing : 0.14
% 3.56/1.91 Reduction : 0.16
% 3.56/1.91 Demodulation : 0.13
% 3.56/1.91 BG Simplification : 0.02
% 3.56/1.91 Subsumption : 0.07
% 3.56/1.91 Abstraction : 0.02
% 3.56/1.91 MUC search : 0.00
% 3.56/1.91 Cooper : 0.00
% 3.56/1.91 Total : 0.89
% 3.56/1.91 Index Insertion : 0.00
% 3.56/1.91 Index Deletion : 0.00
% 3.56/1.91 Index Matching : 0.00
% 3.56/1.91 BG Taut test : 0.00
%------------------------------------------------------------------------------