TSTP Solution File: GRP166-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP166-3 : 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 : n008.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:20 EDT 2023
% Result : Unsatisfiable 16.09s 7.42s
% Output : CNFRefutation 16.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 21 ( 14 unt; 7 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 16 (; 16 !; 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_116,axiom,
least_upper_bound(b,identity) = b,
file(unknown,unknown) ).
tff(f_56,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_110,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_91,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_118,axiom,
least_upper_bound(a,multiply(b,a)) != multiply(b,a),
file(unknown,unknown) ).
tff(c_34,plain,
least_upper_bound(b,identity) = b,
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_787,plain,
! [Y_65,X_66,Z_67] : ( least_upper_bound(multiply(Y_65,X_66),multiply(Z_67,X_66)) = multiply(least_upper_bound(Y_65,Z_67),X_66) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_5818,plain,
! [Y_126,X_127] : ( multiply(least_upper_bound(Y_126,identity),X_127) = least_upper_bound(multiply(Y_126,X_127),X_127) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_787]) ).
tff(c_8383,plain,
! [X_147] : ( least_upper_bound(multiply(b,X_147),X_147) = multiply(b,X_147) ),
inference(superposition,[status(thm),theory(equality)],[c_34,c_5818]) ).
tff(c_10,plain,
! [Y_9,X_8] : ( least_upper_bound(Y_9,X_8) = least_upper_bound(X_8,Y_9) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_8454,plain,
! [X_147] : ( least_upper_bound(X_147,multiply(b,X_147)) = multiply(b,X_147) ),
inference(superposition,[status(thm),theory(equality)],[c_8383,c_10]) ).
tff(c_36,plain,
least_upper_bound(a,multiply(b,a)) != multiply(b,a),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_51238,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8454,c_36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP166-3 : 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.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 22:16:33 EDT 2023
% 0.15/0.35 % CPUTime :
% 16.09/7.42 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.09/7.43
% 16.09/7.43 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 16.09/7.45
% 16.09/7.45 Inference rules
% 16.09/7.45 ----------------------
% 16.09/7.45 #Ref : 0
% 16.09/7.45 #Sup : 13006
% 16.09/7.45 #Fact : 0
% 16.09/7.45 #Define : 0
% 16.09/7.45 #Split : 0
% 16.09/7.45 #Chain : 0
% 16.09/7.45 #Close : 0
% 16.09/7.45
% 16.09/7.45 Ordering : KBO
% 16.09/7.45
% 16.09/7.45 Simplification rules
% 16.09/7.45 ----------------------
% 16.09/7.45 #Subsume : 158
% 16.09/7.45 #Demod : 13650
% 16.09/7.45 #Tautology : 8236
% 16.09/7.45 #SimpNegUnit : 0
% 16.09/7.45 #BackRed : 5
% 16.09/7.45
% 16.09/7.45 #Partial instantiations: 0
% 16.09/7.45 #Strategies tried : 1
% 16.09/7.45
% 16.09/7.45 Timing (in seconds)
% 16.09/7.45 ----------------------
% 16.09/7.45 Preprocessing : 0.54
% 16.09/7.45 Parsing : 0.31
% 16.09/7.45 CNF conversion : 0.02
% 16.09/7.45 Main loop : 5.84
% 16.09/7.45 Inferencing : 1.00
% 16.09/7.45 Reduction : 3.49
% 16.09/7.45 Demodulation : 3.18
% 16.09/7.45 BG Simplification : 0.10
% 16.09/7.45 Subsumption : 0.96
% 16.09/7.45 Abstraction : 0.15
% 16.09/7.45 MUC search : 0.00
% 16.09/7.45 Cooper : 0.00
% 16.09/7.45 Total : 6.42
% 16.09/7.45 Index Insertion : 0.00
% 16.09/7.45 Index Deletion : 0.00
% 16.09/7.45 Index Matching : 0.00
% 16.09/7.45 BG Taut test : 0.00
%------------------------------------------------------------------------------