TSTP Solution File: GRP139-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP139-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 : n003.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:16 EDT 2023
% Result : Unsatisfiable 2.40s 1.49s
% Output : CNFRefutation 2.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 12
% Syntax : Number of formulae : 18 ( 10 unt; 8 typ; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > c > 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(c,type,
c: $i ).
tff(f_117,axiom,
greatest_lower_bound(a,c) = c,
file(unknown,unknown) ).
tff(f_118,axiom,
greatest_lower_bound(b,c) = c,
file(unknown,unknown) ).
tff(f_95,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_120,axiom,
greatest_lower_bound(greatest_lower_bound(a,b),c) != c,
file(unknown,unknown) ).
tff(c_32,plain,
greatest_lower_bound(a,c) = c,
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_34,plain,
greatest_lower_bound(b,c) = c,
inference(cnfTransformation,[status(thm)],[f_118]) ).
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_95]) ).
tff(c_36,plain,
greatest_lower_bound(greatest_lower_bound(a,b),c) != c,
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_37,plain,
greatest_lower_bound(a,greatest_lower_bound(b,c)) != c,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_36]) ).
tff(c_39,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_32,c_34,c_37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP139-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.15/0.36 % Computer : n003.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:10:23 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.40/1.49 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.40/1.50
% 2.40/1.50 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.55/1.53
% 2.55/1.53 Inference rules
% 2.55/1.53 ----------------------
% 2.55/1.53 #Ref : 0
% 2.55/1.53 #Sup : 0
% 2.55/1.53 #Fact : 0
% 2.55/1.53 #Define : 0
% 2.55/1.53 #Split : 0
% 2.55/1.53 #Chain : 0
% 2.55/1.53 #Close : 0
% 2.55/1.53
% 2.55/1.53 Ordering : KBO
% 2.55/1.53
% 2.55/1.53 Simplification rules
% 2.55/1.53 ----------------------
% 2.55/1.53 #Subsume : 17
% 2.55/1.53 #Demod : 3
% 2.55/1.53 #Tautology : 0
% 2.55/1.53 #SimpNegUnit : 0
% 2.55/1.53 #BackRed : 0
% 2.55/1.53
% 2.55/1.53 #Partial instantiations: 0
% 2.55/1.53 #Strategies tried : 1
% 2.55/1.53
% 2.55/1.53 Timing (in seconds)
% 2.55/1.53 ----------------------
% 2.55/1.53 Preprocessing : 0.45
% 2.55/1.53 Parsing : 0.24
% 2.55/1.53 CNF conversion : 0.02
% 2.55/1.53 Main loop : 0.08
% 2.55/1.53 Inferencing : 0.00
% 2.55/1.53 Reduction : 0.04
% 2.55/1.53 Demodulation : 0.03
% 2.55/1.53 BG Simplification : 0.01
% 2.55/1.53 Subsumption : 0.03
% 2.55/1.53 Abstraction : 0.01
% 2.55/1.53 MUC search : 0.00
% 2.55/1.53 Cooper : 0.00
% 2.55/1.53 Total : 0.59
% 2.55/1.53 Index Insertion : 0.00
% 2.55/1.53 Index Deletion : 0.00
% 2.55/1.53 Index Matching : 0.00
% 2.55/1.53 BG Taut test : 0.00
%------------------------------------------------------------------------------