TSTP Solution File: GRP143-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP143-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 : n024.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:17 EDT 2023
% Result : Unsatisfiable 3.35s 1.80s
% Output : CNFRefutation 3.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 20 ( 13 unt; 7 typ; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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 : 17 (; 17 !; 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_99,axiom,
! [X] : ( greatest_lower_bound(X,X) = X ),
file(unknown,unknown) ).
tff(f_93,axiom,
! [X,Y,Z] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ),
file(unknown,unknown) ).
tff(f_89,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_116,axiom,
greatest_lower_bound(greatest_lower_bound(a,b),a) != greatest_lower_bound(a,b),
file(unknown,unknown) ).
tff(c_18,plain,
! [X_17] : ( greatest_lower_bound(X_17,X_17) = X_17 ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_219,plain,
! [X_48,Y_49,Z_50] : ( greatest_lower_bound(greatest_lower_bound(X_48,Y_49),Z_50) = greatest_lower_bound(X_48,greatest_lower_bound(Y_49,Z_50)) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_283,plain,
! [X_17,Z_50] : ( greatest_lower_bound(X_17,greatest_lower_bound(X_17,Z_50)) = greatest_lower_bound(X_17,Z_50) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_219]) ).
tff(c_8,plain,
! [Y_7,X_6] : ( greatest_lower_bound(Y_7,X_6) = greatest_lower_bound(X_6,Y_7) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_12,plain,
! [X_10,Y_11,Z_12] : ( greatest_lower_bound(greatest_lower_bound(X_10,Y_11),Z_12) = greatest_lower_bound(X_10,greatest_lower_bound(Y_11,Z_12)) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_32,plain,
greatest_lower_bound(greatest_lower_bound(a,b),a) != greatest_lower_bound(a,b),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_33,plain,
greatest_lower_bound(a,greatest_lower_bound(b,a)) != greatest_lower_bound(a,b),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_32]) ).
tff(c_34,plain,
greatest_lower_bound(a,greatest_lower_bound(a,b)) != greatest_lower_bound(a,b),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_33]) ).
tff(c_343,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_283,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP143-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/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.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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 21:53:45 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.35/1.80 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.35/1.80
% 3.35/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.41/1.82
% 3.41/1.82 Inference rules
% 3.41/1.82 ----------------------
% 3.41/1.82 #Ref : 0
% 3.41/1.82 #Sup : 77
% 3.41/1.82 #Fact : 0
% 3.41/1.82 #Define : 0
% 3.41/1.82 #Split : 0
% 3.41/1.82 #Chain : 0
% 3.41/1.82 #Close : 0
% 3.41/1.82
% 3.41/1.82 Ordering : KBO
% 3.41/1.82
% 3.41/1.82 Simplification rules
% 3.41/1.82 ----------------------
% 3.41/1.82 #Subsume : 0
% 3.41/1.82 #Demod : 23
% 3.41/1.82 #Tautology : 54
% 3.41/1.82 #SimpNegUnit : 0
% 3.41/1.82 #BackRed : 1
% 3.41/1.82
% 3.41/1.82 #Partial instantiations: 0
% 3.41/1.82 #Strategies tried : 1
% 3.41/1.82
% 3.41/1.82 Timing (in seconds)
% 3.41/1.82 ----------------------
% 3.44/1.83 Preprocessing : 0.47
% 3.44/1.83 Parsing : 0.25
% 3.44/1.83 CNF conversion : 0.02
% 3.44/1.83 Main loop : 0.30
% 3.44/1.83 Inferencing : 0.10
% 3.44/1.83 Reduction : 0.11
% 3.44/1.83 Demodulation : 0.09
% 3.44/1.83 BG Simplification : 0.02
% 3.44/1.83 Subsumption : 0.06
% 3.44/1.83 Abstraction : 0.01
% 3.44/1.83 MUC search : 0.00
% 3.44/1.83 Cooper : 0.00
% 3.44/1.83 Total : 0.81
% 3.44/1.83 Index Insertion : 0.00
% 3.44/1.83 Index Deletion : 0.00
% 3.44/1.83 Index Matching : 0.00
% 3.44/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------