TSTP Solution File: GRP155-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP155-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 : n029.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 2.06s 1.53s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of formulae : 16 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 8 ( 7 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 ( 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 : 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_115,axiom,
greatest_lower_bound(a,b) = a,
file(unknown,unknown) ).
tff(f_112,axiom,
! [Y,Z,X] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ),
file(unknown,unknown) ).
tff(f_117,axiom,
greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
file(unknown,unknown) ).
tff(c_32,plain,
greatest_lower_bound(a,b) = a,
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_30,plain,
! [Y_31,X_33,Z_32] : ( greatest_lower_bound(multiply(Y_31,X_33),multiply(Z_32,X_33)) = multiply(greatest_lower_bound(Y_31,Z_32),X_33) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_34,plain,
greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_35,plain,
multiply(greatest_lower_bound(a,b),c) != multiply(a,c),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_34]) ).
tff(c_37,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_32,c_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP155-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.13 % 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.17/0.34 % Computer : n029.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu Aug 3 22:16:23 EDT 2023
% 0.17/0.34 % CPUTime :
% 2.06/1.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.06/1.54
% 2.06/1.54 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.50/1.58
% 2.50/1.58 Inference rules
% 2.50/1.58 ----------------------
% 2.50/1.58 #Ref : 0
% 2.50/1.58 #Sup : 0
% 2.50/1.58 #Fact : 0
% 2.50/1.58 #Define : 0
% 2.50/1.58 #Split : 0
% 2.50/1.58 #Chain : 0
% 2.50/1.58 #Close : 0
% 2.50/1.58
% 2.50/1.58 Ordering : KBO
% 2.50/1.58
% 2.50/1.58 Simplification rules
% 2.50/1.58 ----------------------
% 2.50/1.58 #Subsume : 16
% 2.50/1.58 #Demod : 2
% 2.50/1.58 #Tautology : 0
% 2.50/1.58 #SimpNegUnit : 0
% 2.50/1.58 #BackRed : 0
% 2.50/1.58
% 2.50/1.58 #Partial instantiations: 0
% 2.50/1.58 #Strategies tried : 1
% 2.50/1.58
% 2.50/1.58 Timing (in seconds)
% 2.50/1.58 ----------------------
% 2.50/1.58 Preprocessing : 0.45
% 2.50/1.58 Parsing : 0.24
% 2.50/1.58 CNF conversion : 0.02
% 2.50/1.58 Main loop : 0.06
% 2.50/1.58 Inferencing : 0.00
% 2.50/1.58 Reduction : 0.03
% 2.50/1.58 Demodulation : 0.02
% 2.50/1.58 BG Simplification : 0.01
% 2.50/1.58 Subsumption : 0.02
% 2.50/1.58 Abstraction : 0.01
% 2.50/1.58 MUC search : 0.00
% 2.50/1.58 Cooper : 0.00
% 2.50/1.58 Total : 0.57
% 2.50/1.58 Index Insertion : 0.00
% 2.50/1.58 Index Deletion : 0.00
% 2.50/1.58 Index Matching : 0.00
% 2.50/1.58 BG Taut test : 0.00
%------------------------------------------------------------------------------