TSTP Solution File: GRP156-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP156-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 : n021.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 3.23s 1.82s
% Output : CNFRefutation 3.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 12
% Syntax : Number of formulae : 19 ( 11 unt; 8 typ; 0 def)
% Number of atoms : 11 ( 10 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 : 10 (; 10 !; 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,
least_upper_bound(a,b) = b,
file(unknown,unknown) ).
tff(f_105,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_114,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_119,axiom,
greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
file(unknown,unknown) ).
tff(c_32,plain,
least_upper_bound(a,b) = b,
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_159,plain,
! [X_44,Y_45] : ( greatest_lower_bound(X_44,least_upper_bound(X_44,Y_45)) = X_44 ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_183,plain,
greatest_lower_bound(a,b) = a,
inference(superposition,[status(thm),theory(equality)],[c_32,c_159]) ).
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_114]) ).
tff(c_34,plain,
greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
inference(cnfTransformation,[status(thm)],[f_119]) ).
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_341,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_183,c_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP156-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.14 % 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.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 22:25:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.23/1.82 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.23/1.82
% 3.23/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.23/1.85
% 3.23/1.85 Inference rules
% 3.23/1.85 ----------------------
% 3.23/1.85 #Ref : 0
% 3.23/1.85 #Sup : 78
% 3.23/1.85 #Fact : 0
% 3.23/1.85 #Define : 0
% 3.23/1.85 #Split : 0
% 3.23/1.85 #Chain : 0
% 3.23/1.85 #Close : 0
% 3.23/1.85
% 3.23/1.85 Ordering : KBO
% 3.23/1.85
% 3.23/1.85 Simplification rules
% 3.23/1.85 ----------------------
% 3.23/1.85 #Subsume : 0
% 3.23/1.85 #Demod : 31
% 3.23/1.85 #Tautology : 68
% 3.23/1.85 #SimpNegUnit : 0
% 3.23/1.85 #BackRed : 0
% 3.23/1.85
% 3.23/1.85 #Partial instantiations: 0
% 3.23/1.85 #Strategies tried : 1
% 3.23/1.85
% 3.23/1.85 Timing (in seconds)
% 3.23/1.85 ----------------------
% 3.23/1.85 Preprocessing : 0.47
% 3.23/1.85 Parsing : 0.26
% 3.23/1.85 CNF conversion : 0.02
% 3.23/1.85 Main loop : 0.28
% 3.23/1.85 Inferencing : 0.09
% 3.23/1.85 Reduction : 0.10
% 3.23/1.85 Demodulation : 0.08
% 3.23/1.85 BG Simplification : 0.02
% 3.38/1.85 Subsumption : 0.05
% 3.38/1.85 Abstraction : 0.01
% 3.38/1.85 MUC search : 0.00
% 3.38/1.85 Cooper : 0.00
% 3.38/1.85 Total : 0.80
% 3.38/1.85 Index Insertion : 0.00
% 3.38/1.85 Index Deletion : 0.00
% 3.38/1.85 Index Matching : 0.00
% 3.38/1.85 BG Taut test : 0.00
%------------------------------------------------------------------------------