TSTP Solution File: GRP157-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP157-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 : n017.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:19 EDT 2023
% Result : Unsatisfiable 2.50s 1.58s
% Output : CNFRefutation 2.75s
% 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,
least_upper_bound(a,b) = b,
file(unknown,unknown) ).
tff(f_106,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_117,axiom,
least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
file(unknown,unknown) ).
tff(c_32,plain,
least_upper_bound(a,b) = b,
inference(cnfTransformation,[status(thm)],[f_115]) ).
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_106]) ).
tff(c_34,plain,
least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_35,plain,
multiply(c,least_upper_bound(a,b)) != multiply(c,b),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_34]) ).
tff(c_37,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_32,c_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP157-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/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.13/0.35 % Computer : n017.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 21:37:06 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.50/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.50/1.59
% 2.50/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.75/1.62
% 2.75/1.62 Inference rules
% 2.75/1.62 ----------------------
% 2.75/1.62 #Ref : 0
% 2.75/1.62 #Sup : 0
% 2.75/1.62 #Fact : 0
% 2.75/1.62 #Define : 0
% 2.75/1.62 #Split : 0
% 2.75/1.62 #Chain : 0
% 2.75/1.62 #Close : 0
% 2.75/1.62
% 2.75/1.62 Ordering : KBO
% 2.75/1.62
% 2.75/1.62 Simplification rules
% 2.75/1.62 ----------------------
% 2.75/1.62 #Subsume : 16
% 2.75/1.62 #Demod : 2
% 2.75/1.62 #Tautology : 0
% 2.75/1.62 #SimpNegUnit : 0
% 2.75/1.62 #BackRed : 0
% 2.75/1.62
% 2.75/1.62 #Partial instantiations: 0
% 2.75/1.62 #Strategies tried : 1
% 2.75/1.62
% 2.75/1.62 Timing (in seconds)
% 2.75/1.62 ----------------------
% 2.75/1.63 Preprocessing : 0.48
% 2.75/1.63 Parsing : 0.26
% 2.75/1.63 CNF conversion : 0.03
% 2.75/1.63 Main loop : 0.07
% 2.75/1.63 Inferencing : 0.00
% 2.75/1.63 Reduction : 0.03
% 2.75/1.63 Demodulation : 0.02
% 2.75/1.63 BG Simplification : 0.01
% 2.75/1.63 Subsumption : 0.03
% 2.75/1.63 Abstraction : 0.01
% 2.75/1.63 MUC search : 0.00
% 2.75/1.63 Cooper : 0.00
% 2.75/1.63 Total : 0.60
% 2.75/1.63 Index Insertion : 0.00
% 2.75/1.63 Index Deletion : 0.00
% 2.75/1.63 Index Matching : 0.00
% 2.75/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------