TSTP Solution File: GRP136-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP136-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 : n007.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:16 EDT 2023
% Result : Unsatisfiable 2.32s 1.55s
% Output : CNFRefutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 15 ( 8 unt; 7 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 2 ( 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 : 0 (; 0 !; 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_118,axiom,
a != b,
file(unknown,unknown) ).
tff(f_116,axiom,
least_upper_bound(a,b) = a,
file(unknown,unknown) ).
tff(f_115,axiom,
least_upper_bound(a,b) = b,
file(unknown,unknown) ).
tff(c_36,plain,
b != a,
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_34,plain,
least_upper_bound(a,b) = a,
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_32,plain,
least_upper_bound(a,b) = b,
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_37,plain,
b = a,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_32]) ).
tff(c_38,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP136-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.13/0.15 % 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.16/0.35 % Computer : n007.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu Aug 3 22:13:24 EDT 2023
% 0.16/0.35 % CPUTime :
% 2.32/1.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.32/1.55
% 2.32/1.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.67/1.57
% 2.67/1.57 Inference rules
% 2.67/1.57 ----------------------
% 2.67/1.57 #Ref : 0
% 2.67/1.57 #Sup : 0
% 2.67/1.57 #Fact : 0
% 2.67/1.57 #Define : 0
% 2.67/1.57 #Split : 0
% 2.67/1.57 #Chain : 0
% 2.67/1.57 #Close : 0
% 2.67/1.57
% 2.67/1.57 Ordering : KBO
% 2.67/1.57
% 2.67/1.57 Simplification rules
% 2.67/1.57 ----------------------
% 2.67/1.57 #Subsume : 17
% 2.67/1.57 #Demod : 1
% 2.67/1.57 #Tautology : 0
% 2.67/1.57 #SimpNegUnit : 1
% 2.67/1.57 #BackRed : 0
% 2.67/1.57
% 2.67/1.57 #Partial instantiations: 0
% 2.67/1.57 #Strategies tried : 1
% 2.67/1.57
% 2.67/1.57 Timing (in seconds)
% 2.67/1.57 ----------------------
% 2.67/1.57 Preprocessing : 0.47
% 2.67/1.57 Parsing : 0.24
% 2.67/1.57 CNF conversion : 0.03
% 2.67/1.57 Main loop : 0.05
% 2.67/1.57 Inferencing : 0.00
% 2.67/1.57 Reduction : 0.02
% 2.67/1.57 Demodulation : 0.02
% 2.67/1.57 BG Simplification : 0.01
% 2.67/1.57 Subsumption : 0.02
% 2.67/1.57 Abstraction : 0.01
% 2.67/1.57 MUC search : 0.00
% 2.67/1.57 Cooper : 0.00
% 2.67/1.58 Total : 0.56
% 2.67/1.58 Index Insertion : 0.00
% 2.67/1.58 Index Deletion : 0.00
% 2.67/1.58 Index Matching : 0.00
% 2.67/1.58 BG Taut test : 0.00
%------------------------------------------------------------------------------