TSTP Solution File: LAT014-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT014-1 : TPTP v8.1.2. Released v2.2.0.
% 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 : n025.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:46:14 EDT 2023
% Result : Unsatisfiable 2.36s 1.65s
% Output : CNFRefutation 2.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 12 ( 8 unt; 4 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 : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > join > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(join,type,
join: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(meet,type,
meet: ( $i * $i ) > $i ).
tff(f_32,axiom,
! [X,Y,Z] : ( join(join(meet(X,Y),meet(Y,Z)),Y) = Y ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [X,Y,Z] : ( meet(X,join(Y,join(X,Z))) = X ),
file(unknown,unknown) ).
tff(f_37,axiom,
meet(a,join(a,b)) != a,
file(unknown,unknown) ).
tff(c_220,plain,
! [X_30,Y_31,Z_32] : ( join(join(meet(X_30,Y_31),meet(Y_31,Z_32)),Y_31) = Y_31 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_4,plain,
! [X_4,Y_5,Z_6] : ( meet(X_4,join(Y_5,join(X_4,Z_6))) = X_4 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_239,plain,
! [X_4,Z_6] : ( meet(X_4,join(X_4,Z_6)) = X_4 ),
inference(superposition,[status(thm),theory(equality)],[c_220,c_4]) ).
tff(c_10,plain,
meet(a,join(a,b)) != a,
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_383,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_239,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT014-1 : TPTP v8.1.2. Released v2.2.0.
% 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.15/0.35 % Computer : n025.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 12:49:35 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.36/1.65 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.36/1.66
% 2.36/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.36/1.69
% 2.36/1.69 Inference rules
% 2.36/1.69 ----------------------
% 2.36/1.69 #Ref : 0
% 2.36/1.69 #Sup : 98
% 2.36/1.69 #Fact : 0
% 2.36/1.69 #Define : 0
% 2.36/1.69 #Split : 0
% 2.36/1.69 #Chain : 0
% 2.36/1.69 #Close : 0
% 2.36/1.69
% 2.36/1.69 Ordering : KBO
% 2.36/1.69
% 2.36/1.69 Simplification rules
% 2.36/1.69 ----------------------
% 2.36/1.69 #Subsume : 0
% 2.36/1.69 #Demod : 29
% 2.36/1.69 #Tautology : 49
% 2.36/1.69 #SimpNegUnit : 0
% 2.36/1.69 #BackRed : 1
% 2.36/1.69
% 2.36/1.69 #Partial instantiations: 0
% 2.36/1.69 #Strategies tried : 1
% 2.36/1.69
% 2.36/1.69 Timing (in seconds)
% 2.36/1.69 ----------------------
% 2.36/1.69 Preprocessing : 0.37
% 2.36/1.69 Parsing : 0.21
% 2.36/1.69 CNF conversion : 0.02
% 2.36/1.69 Main loop : 0.27
% 2.36/1.69 Inferencing : 0.11
% 2.36/1.69 Reduction : 0.08
% 2.36/1.69 Demodulation : 0.06
% 2.36/1.69 BG Simplification : 0.01
% 2.36/1.69 Subsumption : 0.05
% 2.36/1.69 Abstraction : 0.01
% 2.36/1.69 MUC search : 0.00
% 2.36/1.69 Cooper : 0.00
% 2.36/1.69 Total : 0.69
% 2.36/1.69 Index Insertion : 0.00
% 2.36/1.69 Index Deletion : 0.00
% 2.36/1.69 Index Matching : 0.00
% 2.36/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------