TSTP Solution File: GRP176-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP176-2 : 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 : n002.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:23 EDT 2023
% Result : Unsatisfiable 2.60s 1.58s
% Output : CNFRefutation 2.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 12
% Syntax : Number of formulae : 17 ( 8 unt; 9 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 ( 3 avg)
% Maximal term depth : 4 ( 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 12 (; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > d > 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(d,type,
d: $i ).
tff(identity,type,
identity: $i ).
tff(c,type,
c: $i ).
tff(f_111,axiom,
! [Y,Z,X] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ),
file(unknown,unknown) ).
tff(f_107,axiom,
! [X,Y,Z] : ( multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)) ),
file(unknown,unknown) ).
tff(f_119,axiom,
multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
file(unknown,unknown) ).
tff(c_28,plain,
! [Y_28,X_30,Z_29] : ( least_upper_bound(multiply(Y_28,X_30),multiply(Z_29,X_30)) = multiply(least_upper_bound(Y_28,Z_29),X_30) ),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_24,plain,
! [X_22,Y_23,Z_24] : ( least_upper_bound(multiply(X_22,Y_23),multiply(X_22,Z_24)) = multiply(X_22,least_upper_bound(Y_23,Z_24)) ),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_34,plain,
least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) != multiply(c,multiply(least_upper_bound(a,b),d)),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_35,plain,
multiply(c,least_upper_bound(multiply(a,d),multiply(b,d))) != multiply(c,multiply(least_upper_bound(a,b),d)),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_34]) ).
tff(c_37,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP176-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/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.34 % Computer : n002.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Thu Aug 3 22:21:31 EDT 2023
% 0.15/0.34 % CPUTime :
% 2.60/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.60/1.59
% 2.60/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.68/1.62
% 2.68/1.62 Inference rules
% 2.68/1.62 ----------------------
% 2.68/1.62 #Ref : 0
% 2.68/1.62 #Sup : 0
% 2.68/1.62 #Fact : 0
% 2.68/1.62 #Define : 0
% 2.68/1.62 #Split : 0
% 2.68/1.62 #Chain : 0
% 2.68/1.62 #Close : 0
% 2.68/1.62
% 2.68/1.62 Ordering : KBO
% 2.68/1.62
% 2.68/1.62 Simplification rules
% 2.68/1.62 ----------------------
% 2.68/1.62 #Subsume : 16
% 2.68/1.62 #Demod : 2
% 2.68/1.62 #Tautology : 0
% 2.68/1.62 #SimpNegUnit : 0
% 2.68/1.62 #BackRed : 0
% 2.68/1.62
% 2.68/1.62 #Partial instantiations: 0
% 2.68/1.62 #Strategies tried : 1
% 2.68/1.62
% 2.68/1.62 Timing (in seconds)
% 2.68/1.62 ----------------------
% 2.68/1.62 Preprocessing : 0.44
% 2.68/1.62 Parsing : 0.24
% 2.68/1.62 CNF conversion : 0.02
% 2.68/1.62 Main loop : 0.06
% 2.68/1.62 Inferencing : 0.00
% 2.68/1.62 Reduction : 0.03
% 2.68/1.62 Demodulation : 0.02
% 2.68/1.62 BG Simplification : 0.01
% 2.68/1.62 Subsumption : 0.03
% 2.68/1.62 Abstraction : 0.01
% 2.68/1.62 MUC search : 0.00
% 2.68/1.62 Cooper : 0.00
% 2.68/1.62 Total : 0.55
% 2.68/1.62 Index Insertion : 0.00
% 2.68/1.62 Index Deletion : 0.00
% 2.68/1.62 Index Matching : 0.00
% 2.68/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------