TSTP Solution File: GRP188-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP188-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 : n023.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 3.24s 2.04s
% Output : CNFRefutation 4.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 19 ( 12 unt; 7 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 16 (; 16 !; 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_92,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_98,axiom,
! [X] : ( least_upper_bound(X,X) = X ),
file(unknown,unknown) ).
tff(f_96,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_117,axiom,
least_upper_bound(b,least_upper_bound(a,b)) != least_upper_bound(a,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_92]) ).
tff(c_16,plain,
! [X_16] : ( least_upper_bound(X_16,X_16) = X_16 ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
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_96]) ).
tff(c_820,plain,
! [X_66,Z_67] : ( least_upper_bound(X_66,least_upper_bound(X_66,Z_67)) = least_upper_bound(X_66,Z_67) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_712]) ).
tff(c_873,plain,
! [X_8,Y_9] : ( least_upper_bound(X_8,least_upper_bound(Y_9,X_8)) = least_upper_bound(X_8,Y_9) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_820]) ).
tff(c_32,plain,
least_upper_bound(b,least_upper_bound(a,b)) != least_upper_bound(a,b),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_1127,plain,
least_upper_bound(b,a) != least_upper_bound(a,b),
inference(demodulation,[status(thm),theory(equality)],[c_873,c_32]) ).
tff(c_1130,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_1127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP188-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 : n023.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 22:35:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.24/2.04 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.24/2.05
% 3.24/2.05 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.01/2.07
% 4.01/2.07 Inference rules
% 4.01/2.07 ----------------------
% 4.01/2.07 #Ref : 0
% 4.01/2.07 #Sup : 278
% 4.01/2.07 #Fact : 0
% 4.01/2.07 #Define : 0
% 4.01/2.07 #Split : 0
% 4.01/2.07 #Chain : 0
% 4.01/2.07 #Close : 0
% 4.01/2.07
% 4.01/2.07 Ordering : KBO
% 4.01/2.07
% 4.01/2.07 Simplification rules
% 4.01/2.07 ----------------------
% 4.01/2.07 #Subsume : 0
% 4.01/2.07 #Demod : 192
% 4.01/2.07 #Tautology : 154
% 4.01/2.07 #SimpNegUnit : 0
% 4.01/2.07 #BackRed : 1
% 4.01/2.07
% 4.01/2.07 #Partial instantiations: 0
% 4.01/2.07 #Strategies tried : 1
% 4.01/2.07
% 4.01/2.07 Timing (in seconds)
% 4.01/2.07 ----------------------
% 4.01/2.07 Preprocessing : 0.46
% 4.01/2.07 Parsing : 0.25
% 4.01/2.08 CNF conversion : 0.02
% 4.01/2.08 Main loop : 0.47
% 4.01/2.08 Inferencing : 0.16
% 4.01/2.08 Reduction : 0.19
% 4.01/2.08 Demodulation : 0.15
% 4.01/2.08 BG Simplification : 0.02
% 4.01/2.08 Subsumption : 0.08
% 4.01/2.08 Abstraction : 0.02
% 4.01/2.08 MUC search : 0.00
% 4.01/2.08 Cooper : 0.00
% 4.01/2.08 Total : 0.98
% 4.01/2.08 Index Insertion : 0.00
% 4.01/2.08 Index Deletion : 0.00
% 4.01/2.08 Index Matching : 0.00
% 4.01/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------