TSTP Solution File: GRP165-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP165-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 : 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 9.81s 3.47s
% Output : CNFRefutation 9.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 20 ( 14 unt; 6 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 16 (; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > 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(identity,type,
identity: $i ).
tff(f_92,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_116,axiom,
least_upper_bound(a,identity) = a,
file(unknown,unknown) ).
tff(f_57,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
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_118,axiom,
least_upper_bound(a,multiply(a,a)) != multiply(a,a),
file(unknown,unknown) ).
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_92]) ).
tff(c_32,plain,
least_upper_bound(a,identity) = a,
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_674,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_111]) ).
tff(c_6745,plain,
! [Y_144,X_145] : ( multiply(least_upper_bound(Y_144,identity),X_145) = least_upper_bound(multiply(Y_144,X_145),X_145) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_674]) ).
tff(c_11903,plain,
! [X_177] : ( least_upper_bound(multiply(a,X_177),X_177) = multiply(a,X_177) ),
inference(superposition,[status(thm),theory(equality)],[c_32,c_6745]) ).
tff(c_12043,plain,
! [X_8] : ( least_upper_bound(X_8,multiply(a,X_8)) = multiply(a,X_8) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_11903]) ).
tff(c_34,plain,
least_upper_bound(a,multiply(a,a)) != multiply(a,a),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_14179,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12043,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP165-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.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 22:17:18 EDT 2023
% 0.14/0.35 % CPUTime :
% 9.81/3.47 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.81/3.48
% 9.81/3.48 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.81/3.50
% 9.81/3.50 Inference rules
% 9.81/3.50 ----------------------
% 9.81/3.50 #Ref : 0
% 9.81/3.50 #Sup : 3553
% 9.81/3.50 #Fact : 0
% 9.81/3.50 #Define : 0
% 9.81/3.50 #Split : 0
% 9.81/3.50 #Chain : 0
% 9.81/3.50 #Close : 0
% 9.81/3.50
% 9.81/3.50 Ordering : KBO
% 9.81/3.50
% 9.81/3.50 Simplification rules
% 9.81/3.50 ----------------------
% 9.81/3.50 #Subsume : 95
% 9.81/3.50 #Demod : 3227
% 9.81/3.50 #Tautology : 2050
% 9.81/3.50 #SimpNegUnit : 0
% 9.81/3.50 #BackRed : 5
% 9.81/3.50
% 9.81/3.50 #Partial instantiations: 0
% 9.81/3.50 #Strategies tried : 1
% 9.81/3.50
% 9.81/3.50 Timing (in seconds)
% 9.81/3.50 ----------------------
% 9.81/3.50 Preprocessing : 0.46
% 9.81/3.50 Parsing : 0.25
% 9.81/3.50 CNF conversion : 0.02
% 9.81/3.50 Main loop : 1.92
% 9.81/3.50 Inferencing : 0.54
% 9.81/3.51 Reduction : 0.93
% 9.81/3.51 Demodulation : 0.81
% 9.81/3.51 BG Simplification : 0.06
% 9.81/3.51 Subsumption : 0.29
% 9.81/3.51 Abstraction : 0.08
% 9.81/3.51 MUC search : 0.00
% 9.81/3.51 Cooper : 0.00
% 9.81/3.51 Total : 2.42
% 9.81/3.51 Index Insertion : 0.00
% 9.81/3.51 Index Deletion : 0.00
% 9.81/3.51 Index Matching : 0.00
% 9.81/3.51 BG Taut test : 0.00
%------------------------------------------------------------------------------