TSTP Solution File: GRP182-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP182-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 : n015.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 3.42s 2.12s
% Output : CNFRefutation 3.42s
% 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] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_107,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_127,axiom,
least_upper_bound(identity,greatest_lower_bound(a,identity)) != identity,
file(unknown,unknown) ).
tff(c_101,plain,
! [Y_42,X_43] : ( greatest_lower_bound(Y_42,X_43) = greatest_lower_bound(X_43,Y_42) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_20,plain,
! [X_18,Y_19] : ( least_upper_bound(X_18,greatest_lower_bound(X_18,Y_19)) = X_18 ),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_119,plain,
! [Y_42,X_43] : ( least_upper_bound(Y_42,greatest_lower_bound(X_43,Y_42)) = Y_42 ),
inference(superposition,[status(thm),theory(equality)],[c_101,c_20]) ).
tff(c_32,plain,
least_upper_bound(identity,greatest_lower_bound(a,identity)) != identity,
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_292,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_119,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP182-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.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 22:32:29 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.42/2.12 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.42/2.12
% 3.42/2.12 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.42/2.16
% 3.42/2.16 Inference rules
% 3.42/2.16 ----------------------
% 3.42/2.16 #Ref : 0
% 3.42/2.16 #Sup : 65
% 3.42/2.16 #Fact : 0
% 3.42/2.16 #Define : 0
% 3.42/2.16 #Split : 0
% 3.42/2.16 #Chain : 0
% 3.42/2.16 #Close : 0
% 3.42/2.16
% 3.42/2.16 Ordering : KBO
% 3.42/2.16
% 3.42/2.16 Simplification rules
% 3.42/2.16 ----------------------
% 3.42/2.16 #Subsume : 0
% 3.42/2.16 #Demod : 15
% 3.42/2.16 #Tautology : 44
% 3.42/2.16 #SimpNegUnit : 0
% 3.42/2.16 #BackRed : 1
% 3.42/2.16
% 3.42/2.16 #Partial instantiations: 0
% 3.42/2.16 #Strategies tried : 1
% 3.42/2.16
% 3.42/2.16 Timing (in seconds)
% 3.42/2.16 ----------------------
% 3.42/2.17 Preprocessing : 0.65
% 3.42/2.17 Parsing : 0.36
% 3.42/2.17 CNF conversion : 0.03
% 3.42/2.17 Main loop : 0.38
% 3.42/2.17 Inferencing : 0.13
% 3.42/2.17 Reduction : 0.13
% 3.42/2.17 Demodulation : 0.11
% 3.42/2.17 BG Simplification : 0.02
% 3.42/2.17 Subsumption : 0.08
% 3.42/2.17 Abstraction : 0.02
% 3.42/2.17 MUC search : 0.00
% 3.42/2.17 Cooper : 0.00
% 3.42/2.17 Total : 1.09
% 3.42/2.17 Index Insertion : 0.00
% 3.42/2.17 Index Deletion : 0.00
% 3.42/2.17 Index Matching : 0.00
% 3.42/2.17 BG Taut test : 0.00
%------------------------------------------------------------------------------