TSTP Solution File: LAT042-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT042-1 : TPTP v8.1.2. Released v2.5.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 : n016.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:17 EDT 2023
% Result : Unsatisfiable 92.41s 79.58s
% Output : CNFRefutation 92.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 27 ( 19 unt; 8 typ; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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 : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 36 (; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > join > #nlpp > complement > n1 > n0 > c > 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(n1,type,
n1: $i ).
tff(complement,type,
complement: $i > $i ).
tff(n0,type,
n0: $i ).
tff(meet,type,
meet: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_56,axiom,
! [X,Y] : ( meet(X,Y) = meet(Y,X) ),
file(unknown,unknown) ).
tff(f_67,axiom,
! [X,Y,Z] : ( meet(X,join(Y,Z)) = join(meet(X,Y),meet(X,Z)) ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [X,Y] : ( join(X,meet(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_62,axiom,
! [X,Y,Z] : ( join(join(X,Y),Z) = join(X,join(Y,Z)) ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [X,Y] : ( meet(X,join(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_78,axiom,
join(a,meet(b,join(a,c))) != meet(join(a,b),join(a,c)),
file(unknown,unknown) ).
tff(c_10,plain,
! [Y_8,X_7] : ( meet(Y_8,X_7) = meet(X_7,Y_8) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_726,plain,
! [X_48,Y_49,Z_50] : ( join(meet(X_48,Y_49),meet(X_48,Z_50)) = meet(X_48,join(Y_49,Z_50)) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_38968,plain,
! [Y_279,X_280,Z_281] : ( join(meet(Y_279,X_280),meet(X_280,Z_281)) = meet(X_280,join(Y_279,Z_281)) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_726]) ).
tff(c_8,plain,
! [X_5,Y_6] : ( join(X_5,meet(X_5,Y_6)) = X_5 ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_351,plain,
! [X_39,Y_40,Z_41] : ( join(join(X_39,Y_40),Z_41) = join(X_39,join(Y_40,Z_41)) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_387,plain,
! [X_5,Y_6,Z_41] : ( join(X_5,join(meet(X_5,Y_6),Z_41)) = join(X_5,Z_41) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_351]) ).
tff(c_39084,plain,
! [Y_279,X_280,Z_281] : ( join(Y_279,meet(X_280,join(Y_279,Z_281))) = join(Y_279,meet(X_280,Z_281)) ),
inference(superposition,[status(thm),theory(equality)],[c_38968,c_387]) ).
tff(c_6,plain,
! [X_3,Y_4] : ( meet(X_3,join(X_3,Y_4)) = X_3 ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_39547,plain,
! [X_3,Y_4,Z_281] : ( meet(join(X_3,Y_4),join(X_3,Z_281)) = join(X_3,meet(join(X_3,Y_4),Z_281)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_38968]) ).
tff(c_26,plain,
meet(join(a,b),join(a,c)) != join(a,meet(b,join(a,c))),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_373963,plain,
meet(join(a,b),join(a,c)) != join(a,meet(b,c)),
inference(demodulation,[status(thm),theory(equality)],[c_39084,c_26]) ).
tff(c_418058,plain,
join(a,meet(join(a,b),c)) != join(a,meet(b,c)),
inference(demodulation,[status(thm),theory(equality)],[c_39547,c_373963]) ).
tff(c_418063,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_39084,c_10,c_418058]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT042-1 : TPTP v8.1.2. Released v2.5.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.14/0.35 % Computer : n016.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 12:50:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 92.41/79.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 92.49/79.59
% 92.49/79.59 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 92.49/79.62
% 92.49/79.62 Inference rules
% 92.49/79.62 ----------------------
% 92.49/79.62 #Ref : 0
% 92.49/79.62 #Sup : 104441
% 92.49/79.62 #Fact : 0
% 92.49/79.62 #Define : 0
% 92.49/79.62 #Split : 0
% 92.49/79.62 #Chain : 0
% 92.49/79.62 #Close : 0
% 92.49/79.62
% 92.49/79.62 Ordering : KBO
% 92.49/79.62
% 92.49/79.62 Simplification rules
% 92.49/79.62 ----------------------
% 92.49/79.62 #Subsume : 5488
% 92.49/79.62 #Demod : 175283
% 92.49/79.62 #Tautology : 63911
% 92.49/79.62 #SimpNegUnit : 0
% 92.49/79.62 #BackRed : 6
% 92.49/79.62
% 92.49/79.62 #Partial instantiations: 0
% 92.49/79.62 #Strategies tried : 1
% 92.49/79.62
% 92.49/79.62 Timing (in seconds)
% 92.49/79.62 ----------------------
% 92.49/79.62 Preprocessing : 0.46
% 92.49/79.62 Parsing : 0.22
% 92.49/79.62 CNF conversion : 0.02
% 92.49/79.62 Main loop : 78.02
% 92.49/79.62 Inferencing : 5.29
% 92.49/79.62 Reduction : 58.71
% 92.49/79.62 Demodulation : 56.31
% 92.49/79.62 BG Simplification : 0.55
% 92.49/79.62 Subsumption : 10.51
% 92.49/79.62 Abstraction : 1.46
% 92.49/79.62 MUC search : 0.00
% 92.49/79.62 Cooper : 0.00
% 92.49/79.62 Total : 78.53
% 92.49/79.62 Index Insertion : 0.00
% 92.49/79.62 Index Deletion : 0.00
% 92.49/79.62 Index Matching : 0.00
% 92.49/79.62 BG Taut test : 0.00
%------------------------------------------------------------------------------